/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:20:51,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:20:51,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:20:51,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:20:51,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:20:51,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:20:51,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:20:51,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:20:51,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:20:51,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:20:51,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:20:51,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:20:51,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:20:51,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:20:51,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:20:51,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:20:51,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:20:51,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:20:51,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:20:51,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:20:51,147 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:20:51,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:20:51,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:20:51,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:20:51,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:20:51,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:20:51,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:20:51,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:20:51,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:20:51,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:20:51,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:20:51,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:20:51,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:20:51,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:20:51,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:20:51,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:20:51,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:20:51,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:20:51,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:20:51,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:20:51,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:20:51,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:20:51,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:20:51,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:20:51,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:20:51,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:20:51,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:20:51,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:20:51,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:20:51,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:20:51,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:20:51,190 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:20:51,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:20:51,191 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:20:51,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:20:51,192 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:20:51,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:20:51,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:20:51,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:20:51,193 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:20:51,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:20:51,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:20:51,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 12:20:51,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:20:51,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:20:51,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:20:51,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:20:51,420 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:20:51,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-07 12:20:51,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3d99a7d/2e20451ba2bb4ed5945182241f5b3f32/FLAGb339293f5 [2022-04-07 12:20:51,766 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:20:51,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-07 12:20:51,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3d99a7d/2e20451ba2bb4ed5945182241f5b3f32/FLAGb339293f5 [2022-04-07 12:20:52,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3d99a7d/2e20451ba2bb4ed5945182241f5b3f32 [2022-04-07 12:20:52,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:20:52,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:20:52,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:20:52,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:20:52,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:20:52,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af973b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52, skipping insertion in model container [2022-04-07 12:20:52,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:20:52,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:20:52,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c[403,416] [2022-04-07 12:20:52,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:20:52,379 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:20:52,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c[403,416] [2022-04-07 12:20:52,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:20:52,398 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:20:52,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52 WrapperNode [2022-04-07 12:20:52,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:20:52,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:20:52,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:20:52,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:20:52,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:20:52,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:20:52,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:20:52,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:20:52,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (1/1) ... [2022-04-07 12:20:52,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:20:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:20:52,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 12:20:52,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 12:20:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:20:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:20:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:20:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:20:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:20:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:20:52,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:20:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:20:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:20:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:20:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:20:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:20:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:20:52,515 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:20:52,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:20:52,670 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:20:52,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:20:52,675 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:20:52,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:20:52 BoogieIcfgContainer [2022-04-07 12:20:52,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:20:52,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:20:52,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:20:52,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:20:52,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:20:52" (1/3) ... [2022-04-07 12:20:52,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76972e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:20:52, skipping insertion in model container [2022-04-07 12:20:52,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:20:52" (2/3) ... [2022-04-07 12:20:52,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76972e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:20:52, skipping insertion in model container [2022-04-07 12:20:52,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:20:52" (3/3) ... [2022-04-07 12:20:52,681 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew2.c [2022-04-07 12:20:52,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:20:52,685 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:20:52,732 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:20:52,736 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:20:52,736 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:20:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:20:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 12:20:52,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:20:52,754 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:20:52,754 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:20:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:20:52,758 INFO L85 PathProgramCache]: Analyzing trace with hash -818707046, now seen corresponding path program 1 times [2022-04-07 12:20:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:20:52,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157042710] [2022-04-07 12:20:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:20:52,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:20:52,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736334932] [2022-04-07 12:20:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:52,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:20:52,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:20:52,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 12:20:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:52,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 12:20:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:52,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:20:53,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-07 12:20:53,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {24#true} is VALID [2022-04-07 12:20:53,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-07 12:20:53,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-07 12:20:53,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-07 12:20:53,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-07 12:20:53,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {47#(= main_~i~0 0)} is VALID [2022-04-07 12:20:53,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {51#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-07 12:20:53,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(not (< 0 (mod main_~n~0 4294967296)))} assume ~n~0 % 4294967296 > 0; {25#false} is VALID [2022-04-07 12:20:53,076 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-07 12:20:53,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-07 12:20:53,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-07 12:20:53,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-07 12:20:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:53,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:20:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:20:53,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157042710] [2022-04-07 12:20:53,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:20:53,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736334932] [2022-04-07 12:20:53,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736334932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:20:53,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:20:53,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:20:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820974496] [2022-04-07 12:20:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:20:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 12:20:53,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:53,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:53,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 12:20:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 12:20:53,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 12:20:53,122 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:53,248 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-07 12:20:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:20:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 12:20:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:20:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 12:20:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 12:20:53,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-07 12:20:53,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:53,317 INFO L225 Difference]: With dead ends: 42 [2022-04-07 12:20:53,317 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 12:20:53,319 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:20:53,324 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:20:53,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:20:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 12:20:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 12:20:53,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:20:53,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,345 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,345 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:53,349 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:20:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:20:53,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:53,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:53,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 12:20:53,350 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 12:20:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:53,351 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 12:20:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:20:53,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:53,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:53,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:20:53,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:20:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 12:20:53,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-07 12:20:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:20:53,354 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 12:20:53,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:20:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 12:20:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 12:20:53,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:20:53,355 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:20:53,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:20:53,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-07 12:20:53,556 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:20:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:20:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1914943323, now seen corresponding path program 1 times [2022-04-07 12:20:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:20:53,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542418665] [2022-04-07 12:20:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:20:53,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:20:53,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736691761] [2022-04-07 12:20:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:53,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:20:53,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:20:53,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 12:20:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:53,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:20:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:53,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:20:54,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2022-04-07 12:20:54,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {181#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:20:54,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#(= ~SIZE~0 20000001)} assume true; {181#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:20:54,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#(= ~SIZE~0 20000001)} {173#true} #55#return; {181#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:20:54,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {181#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:20:54,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {181#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:20:54,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {197#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-07 12:20:54,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {201#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 12:20:54,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {205#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 12:20:54,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume ~n~0 % 4294967296 > 0; {201#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 12:20:54,071 INFO L272 TraceCheckUtils]: 10: Hoare triple {201#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {212#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:54,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {216#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:54,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {174#false} is VALID [2022-04-07 12:20:54,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-07 12:20:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:54,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:20:54,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-07 12:20:54,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {174#false} is VALID [2022-04-07 12:20:54,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {216#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:54,710 INFO L272 TraceCheckUtils]: 10: Hoare triple {232#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {212#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:54,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {232#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 12:20:54,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {236#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-07 12:20:54,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {240#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-07 12:20:54,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {244#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-07 12:20:54,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:20:54,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:20:54,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {173#true} #55#return; {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:20:54,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:20:54,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {248#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:20:54,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2022-04-07 12:20:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:20:54,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542418665] [2022-04-07 12:20:54,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:20:54,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736691761] [2022-04-07 12:20:54,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736691761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:20:54,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:20:54,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-04-07 12:20:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529245229] [2022-04-07 12:20:54,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:20:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-07 12:20:54,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:54,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:20:54,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:54,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 12:20:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 12:20:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:20:54,747 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:21:00,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:21:02,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:21:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:07,437 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-07 12:21:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 12:21:07,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-07 12:21:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:21:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:21:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-07 12:21:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:21:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-07 12:21:07,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-04-07 12:21:09,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:09,125 INFO L225 Difference]: With dead ends: 28 [2022-04-07 12:21:09,125 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 12:21:09,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-04-07 12:21:09,126 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:21:09,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 63 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-04-07 12:21:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 12:21:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 12:21:09,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:21:09,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:09,131 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:09,131 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:09,132 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 12:21:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 12:21:09,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:09,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:09,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 12:21:09,133 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 12:21:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:09,133 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 12:21:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 12:21:09,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:09,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:09,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:21:09,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:21:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:21:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-07 12:21:09,135 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-07 12:21:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:21:09,135 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-07 12:21:09,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:21:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 12:21:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:21:09,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:21:09,136 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:21:09,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 12:21:09,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-07 12:21:09,352 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:21:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:21:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 580021722, now seen corresponding path program 2 times [2022-04-07 12:21:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:21:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339920075] [2022-04-07 12:21:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:21:09,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:21:09,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509049134] [2022-04-07 12:21:09,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:21:09,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:09,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:21:09,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:21:09,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 12:21:09,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:21:09,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:21:09,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-07 12:21:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:09,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:21:09,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2022-04-07 12:21:09,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {397#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:21:09,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#(= ~SIZE~0 20000001)} assume true; {397#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:21:09,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#(= ~SIZE~0 20000001)} {389#true} #55#return; {397#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:21:09,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {397#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:21:09,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {397#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:21:09,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {413#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-07 12:21:09,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {417#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-07 12:21:09,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {421#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} is VALID [2022-04-07 12:21:09,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {421#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {425#(and (= 3 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 6) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-07 12:21:09,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {425#(and (= 3 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 6) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {429#(and (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 3 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-07 12:21:09,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(and (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 3 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 6)) 6))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {433#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-07 12:21:09,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {433#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} assume ~n~0 % 4294967296 > 0; {433#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-07 12:21:09,910 INFO L272 TraceCheckUtils]: 13: Hoare triple {433#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:09,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:09,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {390#false} is VALID [2022-04-07 12:21:09,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {390#false} assume !false; {390#false} is VALID [2022-04-07 12:21:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:09,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:21:11,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {390#false} assume !false; {390#false} is VALID [2022-04-07 12:21:11,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {390#false} is VALID [2022-04-07 12:21:11,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:11,644 INFO L272 TraceCheckUtils]: 13: Hoare triple {460#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:11,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {460#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 12:21:11,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {460#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 12:21:11,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {467#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-07 12:21:11,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {471#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-07 12:21:11,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {475#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-07 12:21:11,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {479#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-07 12:21:11,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {483#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-07 12:21:11,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:21:11,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:21:11,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {389#true} #55#return; {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:21:11,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:21:11,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {487#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:21:11,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2022-04-07 12:21:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:21:11,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339920075] [2022-04-07 12:21:11,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:21:11,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509049134] [2022-04-07 12:21:11,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509049134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:21:11,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:21:11,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-07 12:21:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708821713] [2022-04-07 12:21:11,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:21:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:21:11,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:21:11,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:21:11,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:11,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 12:21:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:21:11,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 12:21:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:21:11,705 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:23:00,907 WARN L232 SmtUtils]: Spent 1.59m on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:23:04,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:23:06,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:23:08,447 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_main_~i~0 4294967296)) (.cse4 (mod (+ c_main_~i~0 3) 4294967296)) (.cse0 (mod (+ c_main_~i~0 6) 4294967296)) (.cse3 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (let ((.cse1 (mod (+ c_main_~i~0 9) 4294967296))) (or (<= (div (+ .cse0 (* (- 1) .cse1)) (- 4294967296)) 0) (let ((.cse2 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse2 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse1 .cse3) 4294967296) 0)) (= .cse2 .cse1))))) (or (let ((.cse5 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse4 .cse3) 4294967296) 0)) (= .cse5 .cse4) (= .cse5 (mod (+ 3 c_main_~k~0) 4294967296)))) (<= (div (+ .cse6 (* (- 1) .cse4)) (- 4294967296)) 0)) (or (< .cse6 (mod c_main_~n~0 4294967296)) (let ((.cse7 (mod c_main_~j~0 4294967296))) (and (= .cse7 (mod c_main_~k~0 4294967296)) (= .cse7 .cse6) (not (= 0 (mod (mod .cse6 .cse3) 4294967296)))))) (or (<= (div (+ (* (- 1) .cse0) .cse4) (- 4294967296)) 0) (let ((.cse8 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse8 .cse0) (= .cse8 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse0 .cse3) 4294967296) 0))))) (= 20000001 c_~SIZE~0))) is different from false [2022-04-07 12:23:21,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:23:28,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:23:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:38,103 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-07 12:23:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 12:23:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:23:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:23:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 45 transitions. [2022-04-07 12:23:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:23:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 45 transitions. [2022-04-07 12:23:38,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 45 transitions. [2022-04-07 12:23:42,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:42,727 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:23:42,728 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 12:23:42,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 129.1s TimeCoverageRelationStatistics Valid=165, Invalid=483, Unknown=6, NotChecked=48, Total=702 [2022-04-07 12:23:42,729 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:42,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 3 Unknown, 2 Unchecked, 10.2s Time] [2022-04-07 12:23:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 12:23:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 12:23:42,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:42,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:42,745 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:42,745 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:42,746 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-07 12:23:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-07 12:23:42,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:42,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:42,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-07 12:23:42,746 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-07 12:23:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:42,747 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-07 12:23:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-07 12:23:42,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:42,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:42,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:42,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:23:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-07 12:23:42,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2022-04-07 12:23:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:42,749 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-07 12:23:42,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:23:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-07 12:23:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 12:23:42,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:42,751 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:42,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 12:23:42,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:42,964 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash -660648390, now seen corresponding path program 3 times [2022-04-07 12:23:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:42,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77290451] [2022-04-07 12:23:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:43,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:23:43,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160400916] [2022-04-07 12:23:43,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:23:43,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:43,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:23:43,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 12:23:43,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-07 12:23:43,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:23:43,219 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-07 12:23:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:43,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:43,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2022-04-07 12:23:43,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {687#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:23:43,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#(= ~SIZE~0 20000001)} assume true; {687#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:23:43,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#(= ~SIZE~0 20000001)} {679#true} #55#return; {687#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:23:43,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {687#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:23:43,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {687#(= ~SIZE~0 20000001)} is VALID [2022-04-07 12:23:43,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {703#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-07 12:23:43,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {703#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {707#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 12:23:43,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {711#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-07 12:23:43,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {715#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-07 12:23:43,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {715#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {719#(and (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-07 12:23:43,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {719#(and (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {723#(and (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-07 12:23:43,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {723#(and (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {727#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-07 12:23:43,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {731#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)) (= main_~j~0 21))} is VALID [2022-04-07 12:23:43,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {735#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} is VALID [2022-04-07 12:23:43,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {735#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {739#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-07 12:23:43,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {743#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-07 12:23:43,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {743#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {747#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-07 12:23:43,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {747#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} assume ~n~0 % 4294967296 > 0; {743#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-07 12:23:43,801 INFO L272 TraceCheckUtils]: 19: Hoare triple {743#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:23:43,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:23:43,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {680#false} is VALID [2022-04-07 12:23:43,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-04-07 12:23:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:43,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:49,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-04-07 12:23:49,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {680#false} is VALID [2022-04-07 12:23:49,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:23:49,644 INFO L272 TraceCheckUtils]: 19: Hoare triple {774#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:23:49,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {778#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {774#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 12:23:49,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {778#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-07 12:23:49,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {786#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {782#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-07 12:23:49,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {790#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {786#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-07 12:23:49,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {790#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-07 12:23:49,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {798#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {794#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-07 12:23:49,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {802#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {798#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-07 12:23:49,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {806#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {802#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-07 12:23:49,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {810#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {806#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-07 12:23:49,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {814#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {810#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-07 12:23:49,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {818#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {814#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-07 12:23:49,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {818#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-07 12:23:49,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {822#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-07 12:23:49,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:23:49,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:23:49,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {679#true} #55#return; {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:23:49,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:23:49,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {826#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 12:23:49,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2022-04-07 12:23:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77290451] [2022-04-07 12:23:49,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:23:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160400916] [2022-04-07 12:23:49,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160400916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:23:49,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:23:49,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2022-04-07 12:23:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901266976] [2022-04-07 12:23:49,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:23:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-07 12:23:49,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:49,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:23:49,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:49,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 12:23:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 12:23:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-04-07 12:23:49,768 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:23:52,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_main_~j~0 4294967296)) (.cse22 (mod c_main_~i~0 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (let ((.cse0 (mod (+ c_main_~i~0 18) 4294967296))) (or (<= 0 (div (* (- 1) .cse0) 4294967296)) (let ((.cse2 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse0 .cse2) (= .cse2 (mod (+ 18 c_main_~k~0) 4294967296)))))) (let ((.cse4 (mod (+ c_main_~i~0 27) 4294967296))) (or (let ((.cse3 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse3 .cse4) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse3) (not (= (mod (mod .cse4 .cse1) 4294967296) 0)))) (<= 0 (div (* (- 1) .cse4) 4294967296)))) (let ((.cse5 (mod (+ c_main_~i~0 6) 4294967296))) (or (<= 0 (div (* (- 1) .cse5) 4294967296)) (let ((.cse6 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse6 .cse5) (= .cse6 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0)))))) (let ((.cse7 (mod (+ c_main_~i~0 3) 4294967296))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse1) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (<= 0 (div (* (- 1) .cse7) 4294967296)))) (let ((.cse9 (mod (+ c_main_~i~0 21) 4294967296))) (or (<= 0 (div (* (- 1) .cse9) 4294967296)) (let ((.cse10 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse10 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (= .cse10 .cse9))))) (let ((.cse11 (mod (+ c_main_~i~0 24) 4294967296))) (or (<= 0 (div (* (- 1) .cse11) 4294967296)) (let ((.cse12 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse12 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0)) (= .cse12 .cse11))))) (let ((.cse14 (mod (+ c_main_~i~0 9) 4294967296))) (or (let ((.cse13 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse13 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (= .cse13 .cse14))) (<= 0 (div (* (- 1) .cse14) 4294967296)))) (= .cse15 (mod c_main_~k~0 4294967296)) (let ((.cse16 (mod (+ c_main_~i~0 30) 4294967296))) (or (<= 0 (div (* (- 1) .cse16) 4294967296)) (let ((.cse17 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse17 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (= .cse16 .cse17))))) (= 20000001 c_~SIZE~0) (let ((.cse18 (mod (+ c_main_~i~0 15) 4294967296))) (or (<= 0 (div (* (- 1) .cse18) 4294967296)) (let ((.cse19 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse18 .cse19) (= .cse19 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse18 .cse1) 4294967296) 0)))))) (let ((.cse21 (mod (+ c_main_~i~0 12) 4294967296))) (or (let ((.cse20 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse20 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse20 .cse21) (not (= (mod (mod .cse21 .cse1) 4294967296) 0)))) (<= 0 (div (* (- 1) .cse21) 4294967296)))) (= .cse15 .cse22) (not (= 0 (mod (mod .cse22 .cse1) 4294967296))))) is different from false [2022-04-07 12:26:43,708 WARN L232 SmtUtils]: Spent 2.63m on a formula simplification that was a NOOP. DAG size: 187 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:26:48,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:26:51,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:26:55,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:32:43,822 WARN L232 SmtUtils]: Spent 5.64m on a formula simplification. DAG size of input: 192 DAG size of output: 189 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:32:46,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:32:50,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:32:54,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []