/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/nla-digbench-scaling/prodbin-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:26:30,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:26:30,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:26:31,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:26:31,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:26:31,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:26:31,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:26:31,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:26:31,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:26:31,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:26:31,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:26:31,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:26:31,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:26:31,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:26:31,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:26:31,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:26:31,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:26:31,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:26:31,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:26:31,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:26:31,052 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:26:31,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:26:31,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:26:31,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:26:31,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:26:31,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:26:31,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:26:31,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:26:31,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:26:31,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:26:31,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:26:31,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:26:31,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:26:31,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:26:31,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:26:31,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:26:31,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:26:31,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:26:31,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:26:31,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:26:31,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:26:31,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:26:31,070 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-27 14:26:31,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:26:31,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:26:31,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:26:31,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:26:31,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:26:31,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:26:31,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:26:31,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:26:31,101 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:26:31,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:26:31,102 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:26:31,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:26:31,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:26:31,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:26:31,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:26:31,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:26:31,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:26:31,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:26:31,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:26:31,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:26:31,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:26:31,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:26:31,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:26:31,105 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:26:31,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:26:31,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:26:31,105 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-27 14:26:31,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:26:31,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:26:31,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:26:31,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:26:31,333 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:26:31,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2022-04-27 14:26:31,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5408ba80d/2693128cd5454607bcad7146222f7655/FLAGf148b3322 [2022-04-27 14:26:31,742 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:26:31,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2022-04-27 14:26:31,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5408ba80d/2693128cd5454607bcad7146222f7655/FLAGf148b3322 [2022-04-27 14:26:32,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5408ba80d/2693128cd5454607bcad7146222f7655 [2022-04-27 14:26:32,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:26:32,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:26:32,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:26:32,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:26:32,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:26:32,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7753b0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32, skipping insertion in model container [2022-04-27 14:26:32,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:26:32,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:26:32,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound2.c[537,550] [2022-04-27 14:26:32,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:26:32,353 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:26:32,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound2.c[537,550] [2022-04-27 14:26:32,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:26:32,393 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:26:32,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32 WrapperNode [2022-04-27 14:26:32,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:26:32,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:26:32,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:26:32,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:26:32,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:26:32,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:26:32,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:26:32,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:26:32,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (1/1) ... [2022-04-27 14:26:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:26:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:32,461 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-27 14:26:32,463 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-27 14:26:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:26:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:26:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:26:32,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:26:32,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:26:32,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:26:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:26:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:26:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:26:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:26:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:26:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:26:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:26:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:26:32,547 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:26:32,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:26:32,660 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:26:32,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:26:32,666 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:26:32,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:26:32 BoogieIcfgContainer [2022-04-27 14:26:32,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:26:32,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:26:32,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:26:32,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:26:32,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:26:32" (1/3) ... [2022-04-27 14:26:32,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b665bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:26:32, skipping insertion in model container [2022-04-27 14:26:32,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:32" (2/3) ... [2022-04-27 14:26:32,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b665bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:26:32, skipping insertion in model container [2022-04-27 14:26:32,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:26:32" (3/3) ... [2022-04-27 14:26:32,675 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound2.c [2022-04-27 14:26:32,687 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:26:32,688 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:26:32,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:26:32,733 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@497618fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d3fea3e [2022-04-27 14:26:32,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:26:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:26:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:26:32,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:32,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:32,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:32,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 1 times [2022-04-27 14:26:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12991266] [2022-04-27 14:26:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:26:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:32,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 14:26:32,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:26:32,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-27 14:26:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:26:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:32,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:26:32,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:26:32,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:26:32,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:26:32,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:26:32,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 14:26:32,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:26:32,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-27 14:26:32,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 14:26:32,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 14:26:32,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-27 14:26:32,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:26:32,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:26:32,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:26:32,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:26:32,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {34#false} is VALID [2022-04-27 14:26:32,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 14:26:32,974 INFO L272 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {34#false} is VALID [2022-04-27 14:26:32,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 14:26:32,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 14:26:32,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 14:26:32,975 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-27 14:26:32,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12991266] [2022-04-27 14:26:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12991266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:26:32,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:26:32,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:26:32,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411235121] [2022-04-27 14:26:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:26:32,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:26:32,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:32,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:33,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:33,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:26:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:26:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:26:33,057 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:33,239 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 14:26:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:26:33,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:26:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 14:26:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 14:26:33,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-27 14:26:33,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:33,347 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:26:33,347 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:26:33,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:26:33,353 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:33,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:26:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:26:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 14:26:33,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:33,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,386 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,387 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:33,390 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:26:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:26:33,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:33,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:33,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 14:26:33,392 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 14:26:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:33,396 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:26:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:26:33,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:33,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:33,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:33,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 14:26:33,404 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-27 14:26:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:33,404 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 14:26:33,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:26:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:26:33,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:33,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:33,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:26:33,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 1 times [2022-04-27 14:26:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:33,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908814232] [2022-04-27 14:26:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:33,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:33,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075815650] [2022-04-27 14:26:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:33,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:33,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:33,452 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-27 14:26:33,453 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-27 14:26:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:33,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:26:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:33,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:33,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2022-04-27 14:26:33,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#(<= ~counter~0 0)} assume true; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207#(<= ~counter~0 0)} {199#true} #65#return; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {207#(<= ~counter~0 0)} call #t~ret7 := main(); {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {207#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {207#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(<= ~counter~0 0)} ~cond := #in~cond; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(<= ~counter~0 0)} assume !(0 == ~cond); {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#(<= ~counter~0 0)} assume true; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {207#(<= ~counter~0 0)} {207#(<= ~counter~0 0)} #59#return; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {207#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {207#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:33,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {241#(<= |main_#t~post6| 0)} is VALID [2022-04-27 14:26:33,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {241#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {200#false} is VALID [2022-04-27 14:26:33,644 INFO L272 TraceCheckUtils]: 14: Hoare triple {200#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {200#false} is VALID [2022-04-27 14:26:33,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {200#false} ~cond := #in~cond; {200#false} is VALID [2022-04-27 14:26:33,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {200#false} assume 0 == ~cond; {200#false} is VALID [2022-04-27 14:26:33,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {200#false} assume !false; {200#false} is VALID [2022-04-27 14:26:33,645 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-27 14:26:33,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:26:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:33,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908814232] [2022-04-27 14:26:33,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:33,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075815650] [2022-04-27 14:26:33,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075815650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:26:33,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:26:33,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:26:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795711690] [2022-04-27 14:26:33,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:26:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:26:33,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:33,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:26:33,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:33,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:26:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:26:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:26:33,665 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:26:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:33,715 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 14:26:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:26:33,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:26:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:26:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 14:26:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:26:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 14:26:33,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-27 14:26:33,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:33,766 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:26:33,766 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:26:33,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:26:33,767 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:33,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:26:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:26:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:26:33,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:33,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,777 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,779 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:33,781 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 14:26:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 14:26:33,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:33,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:33,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 14:26:33,786 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 14:26:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:33,791 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 14:26:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 14:26:33,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:33,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:33,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:33,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:26:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-27 14:26:33,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-04-27 14:26:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:33,800 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-27 14:26:33,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:26:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 14:26:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:26:33,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:33,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:33,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:26:34,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:34,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 1 times [2022-04-27 14:26:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:34,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062582430] [2022-04-27 14:26:34,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:34,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:34,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911568857] [2022-04-27 14:26:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:34,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:34,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:34,036 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-27 14:26:34,055 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-27 14:26:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:34,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:26:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:34,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:34,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2022-04-27 14:26:34,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {395#true} is VALID [2022-04-27 14:26:34,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2022-04-27 14:26:34,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {395#true} {395#true} #65#return; {395#true} is VALID [2022-04-27 14:26:34,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {395#true} call #t~ret7 := main(); {395#true} is VALID [2022-04-27 14:26:34,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {395#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {395#true} is VALID [2022-04-27 14:26:34,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {395#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {395#true} is VALID [2022-04-27 14:26:34,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#true} ~cond := #in~cond; {395#true} is VALID [2022-04-27 14:26:34,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#true} assume !(0 == ~cond); {395#true} is VALID [2022-04-27 14:26:34,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#true} assume true; {395#true} is VALID [2022-04-27 14:26:34,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {395#true} {395#true} #59#return; {395#true} is VALID [2022-04-27 14:26:34,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {433#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:34,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {433#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {433#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:34,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {433#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:34,278 INFO L272 TraceCheckUtils]: 14: Hoare triple {433#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:34,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:34,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {396#false} is VALID [2022-04-27 14:26:34,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {396#false} assume !false; {396#false} is VALID [2022-04-27 14:26:34,280 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-27 14:26:34,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:26:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:34,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062582430] [2022-04-27 14:26:34,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911568857] [2022-04-27 14:26:34,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911568857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:26:34,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:26:34,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:26:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666530256] [2022-04-27 14:26:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:26:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:26:34,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:34,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:34,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:34,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:26:34,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:34,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:26:34,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:26:34,298 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:34,454 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-27 14:26:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:26:34,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:26:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 14:26:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 14:26:34,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 14:26:34,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:34,512 INFO L225 Difference]: With dead ends: 38 [2022-04-27 14:26:34,512 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:26:34,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:26:34,515 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:34,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:26:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:26:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-04-27 14:26:34,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:34,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:34,530 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:34,531 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:34,536 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:26:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:26:34,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:34,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:34,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-27 14:26:34,537 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-27 14:26:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:34,539 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:26:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:26:34,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:34,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:34,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:34,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 14:26:34,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 14:26:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:34,559 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 14:26:34,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:26:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:26:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:26:34,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:34,561 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:34,582 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-27 14:26:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:26:34,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 1 times [2022-04-27 14:26:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:34,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699863169] [2022-04-27 14:26:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:34,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:34,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899020292] [2022-04-27 14:26:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:34,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:34,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:34,808 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-27 14:26:34,811 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-27 14:26:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:34,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:26:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:34,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:34,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2022-04-27 14:26:34,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {624#true} is VALID [2022-04-27 14:26:34,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-27 14:26:34,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #65#return; {624#true} is VALID [2022-04-27 14:26:34,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret7 := main(); {624#true} is VALID [2022-04-27 14:26:34,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {624#true} is VALID [2022-04-27 14:26:34,995 INFO L272 TraceCheckUtils]: 6: Hoare triple {624#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {624#true} is VALID [2022-04-27 14:26:34,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#true} ~cond := #in~cond; {650#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:26:34,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {650#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {654#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:34,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {654#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:34,997 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {654#(not (= |assume_abort_if_not_#in~cond| 0))} {624#true} #59#return; {661#(<= 1 main_~b~0)} is VALID [2022-04-27 14:26:34,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {661#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {665#(<= 1 main_~y~0)} is VALID [2022-04-27 14:26:34,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {665#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {665#(<= 1 main_~y~0)} is VALID [2022-04-27 14:26:34,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {665#(<= 1 main_~y~0)} assume !!(#t~post6 < 2);havoc #t~post6; {665#(<= 1 main_~y~0)} is VALID [2022-04-27 14:26:34,999 INFO L272 TraceCheckUtils]: 14: Hoare triple {665#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {624#true} is VALID [2022-04-27 14:26:35,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {624#true} ~cond := #in~cond; {624#true} is VALID [2022-04-27 14:26:35,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {624#true} assume !(0 == ~cond); {624#true} is VALID [2022-04-27 14:26:35,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-27 14:26:35,008 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {624#true} {665#(<= 1 main_~y~0)} #61#return; {665#(<= 1 main_~y~0)} is VALID [2022-04-27 14:26:35,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {665#(<= 1 main_~y~0)} assume !(0 != ~y~0); {625#false} is VALID [2022-04-27 14:26:35,009 INFO L272 TraceCheckUtils]: 20: Hoare triple {625#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {625#false} is VALID [2022-04-27 14:26:35,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2022-04-27 14:26:35,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2022-04-27 14:26:35,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-27 14:26:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:26:35,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:26:35,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:35,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699863169] [2022-04-27 14:26:35,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:35,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899020292] [2022-04-27 14:26:35,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899020292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:26:35,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:26:35,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:26:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966582121] [2022-04-27 14:26:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:26:35,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:26:35,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:35,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:26:35,037 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-27 14:26:35,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:26:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:26:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:26:35,038 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:26:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:35,182 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:26:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:26:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:26:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:26:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 14:26:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:26:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 14:26:35,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-27 14:26:35,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:35,234 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:26:35,234 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 14:26:35,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:26:35,237 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:35,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:26:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 14:26:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-27 14:26:35,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:35,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:35,251 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:35,251 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:35,253 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 14:26:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 14:26:35,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:35,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:35,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-27 14:26:35,253 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-27 14:26:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:35,255 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 14:26:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 14:26:35,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:35,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:35,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:35,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 14:26:35,257 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2022-04-27 14:26:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:35,257 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 14:26:35,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:26:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 14:26:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:26:35,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:35,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:35,276 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-27 14:26:35,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:35,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 1 times [2022-04-27 14:26:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:35,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182810562] [2022-04-27 14:26:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:35,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020374266] [2022-04-27 14:26:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:35,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:35,477 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-27 14:26:35,506 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-27 14:26:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:35,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:26:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:35,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:35,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {878#true} call ULTIMATE.init(); {878#true} is VALID [2022-04-27 14:26:35,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {878#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {886#(<= ~counter~0 0)} assume true; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {886#(<= ~counter~0 0)} {878#true} #65#return; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {886#(<= ~counter~0 0)} call #t~ret7 := main(); {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {886#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {886#(<= ~counter~0 0)} ~cond := #in~cond; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {886#(<= ~counter~0 0)} assume !(0 == ~cond); {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(<= ~counter~0 0)} assume true; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {886#(<= ~counter~0 0)} {886#(<= ~counter~0 0)} #59#return; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,694 INFO L272 TraceCheckUtils]: 14: Hoare triple {920#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(<= ~counter~0 1)} ~cond := #in~cond; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#(<= ~counter~0 1)} assume !(0 == ~cond); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#(<= ~counter~0 1)} assume true; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,698 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#(<= ~counter~0 1)} {920#(<= ~counter~0 1)} #61#return; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {920#(<= ~counter~0 1)} assume !!(0 != ~y~0); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {920#(<= ~counter~0 1)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#(<= ~counter~0 1)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {920#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {951#(<= |main_#t~post6| 1)} is VALID [2022-04-27 14:26:35,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {951#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {879#false} is VALID [2022-04-27 14:26:35,700 INFO L272 TraceCheckUtils]: 24: Hoare triple {879#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {879#false} is VALID [2022-04-27 14:26:35,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {879#false} ~cond := #in~cond; {879#false} is VALID [2022-04-27 14:26:35,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {879#false} assume 0 == ~cond; {879#false} is VALID [2022-04-27 14:26:35,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {879#false} assume !false; {879#false} is VALID [2022-04-27 14:26:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:26:35,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:26:35,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {879#false} assume !false; {879#false} is VALID [2022-04-27 14:26:35,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {879#false} assume 0 == ~cond; {879#false} is VALID [2022-04-27 14:26:35,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {879#false} ~cond := #in~cond; {879#false} is VALID [2022-04-27 14:26:35,873 INFO L272 TraceCheckUtils]: 24: Hoare triple {879#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {879#false} is VALID [2022-04-27 14:26:35,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {951#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {879#false} is VALID [2022-04-27 14:26:35,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {920#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {951#(<= |main_#t~post6| 1)} is VALID [2022-04-27 14:26:35,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#(<= ~counter~0 1)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {920#(<= ~counter~0 1)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {920#(<= ~counter~0 1)} assume !!(0 != ~y~0); {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,891 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {878#true} {920#(<= ~counter~0 1)} #61#return; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {878#true} assume true; {878#true} is VALID [2022-04-27 14:26:35,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {878#true} assume !(0 == ~cond); {878#true} is VALID [2022-04-27 14:26:35,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {878#true} ~cond := #in~cond; {878#true} is VALID [2022-04-27 14:26:35,891 INFO L272 TraceCheckUtils]: 14: Hoare triple {920#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {878#true} is VALID [2022-04-27 14:26:35,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {920#(<= ~counter~0 1)} is VALID [2022-04-27 14:26:35,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {878#true} {886#(<= ~counter~0 0)} #59#return; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#true} assume true; {878#true} is VALID [2022-04-27 14:26:35,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#true} assume !(0 == ~cond); {878#true} is VALID [2022-04-27 14:26:35,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#true} ~cond := #in~cond; {878#true} is VALID [2022-04-27 14:26:35,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {886#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {878#true} is VALID [2022-04-27 14:26:35,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {886#(<= ~counter~0 0)} call #t~ret7 := main(); {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {886#(<= ~counter~0 0)} {878#true} #65#return; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {886#(<= ~counter~0 0)} assume true; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {878#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {886#(<= ~counter~0 0)} is VALID [2022-04-27 14:26:35,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {878#true} call ULTIMATE.init(); {878#true} is VALID [2022-04-27 14:26:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:26:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:35,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182810562] [2022-04-27 14:26:35,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:35,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020374266] [2022-04-27 14:26:35,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020374266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:26:35,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:26:35,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 14:26:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114113289] [2022-04-27 14:26:35,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:26:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2022-04-27 14:26:35,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:35,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:26:35,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:35,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:26:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:26:35,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:26:35,934 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:26:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:36,013 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-27 14:26:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:26:36,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2022-04-27 14:26:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:26:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-27 14:26:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:26:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-27 14:26:36,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-04-27 14:26:36,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:36,051 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:26:36,051 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:26:36,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:26:36,052 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:36,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:26:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:26:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 14:26:36,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:36,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:36,067 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:36,067 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:36,069 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-27 14:26:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-27 14:26:36,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:36,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:36,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-27 14:26:36,070 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-27 14:26:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:36,071 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-27 14:26:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-27 14:26:36,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:36,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:36,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:36,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:26:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-27 14:26:36,073 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2022-04-27 14:26:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:36,074 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-27 14:26:36,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:26:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-27 14:26:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:26:36,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:36,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:36,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:26:36,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:36,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:36,296 INFO L85 PathProgramCache]: Analyzing trace with hash 586406521, now seen corresponding path program 1 times [2022-04-27 14:26:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:36,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142136314] [2022-04-27 14:26:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:36,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:36,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:36,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000737822] [2022-04-27 14:26:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:36,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:36,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:26:36,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:26:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:36,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 14:26:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:36,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:37,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2022-04-27 14:26:37,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1237#true} is VALID [2022-04-27 14:26:37,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-04-27 14:26:37,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #65#return; {1237#true} is VALID [2022-04-27 14:26:37,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret7 := main(); {1237#true} is VALID [2022-04-27 14:26:37,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1237#true} is VALID [2022-04-27 14:26:37,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {1237#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1237#true} is VALID [2022-04-27 14:26:37,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#true} ~cond := #in~cond; {1263#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:26:37,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {1263#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:37,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:37,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1267#(not (= |assume_abort_if_not_#in~cond| 0))} {1237#true} #59#return; {1274#(<= 1 main_~b~0)} is VALID [2022-04-27 14:26:37,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:37,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:37,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 2);havoc #t~post6; {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:37,666 INFO L272 TraceCheckUtils]: 14: Hoare triple {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1237#true} is VALID [2022-04-27 14:26:37,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#true} ~cond := #in~cond; {1291#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:37,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {1291#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:37,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:37,668 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} {1278#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #61#return; {1302#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:37,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1302#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:37,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1309#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:26:37,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {1309#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1313#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:26:37,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {1313#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1313#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:26:37,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {1313#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !!(#t~post6 < 2);havoc #t~post6; {1313#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:26:37,675 INFO L272 TraceCheckUtils]: 24: Hoare triple {1313#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:37,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {1323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:37,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {1327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1238#false} is VALID [2022-04-27 14:26:37,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2022-04-27 14:26:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:26:37,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:27:01,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2022-04-27 14:27:01,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {1327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1238#false} is VALID [2022-04-27 14:27:01,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {1323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:01,830 INFO L272 TraceCheckUtils]: 24: Hoare triple {1343#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:01,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {1343#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 2);havoc #t~post6; {1343#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:27:01,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {1343#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1343#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:27:01,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {1353#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1343#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:27:01,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {1357#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1353#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:27:01,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {1357#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1357#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:27:01,842 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} #61#return; {1357#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:27:01,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:01,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {1374#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1295#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:01,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#true} ~cond := #in~cond; {1374#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:27:01,844 INFO L272 TraceCheckUtils]: 14: Hoare triple {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1237#true} is VALID [2022-04-27 14:27:01,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} assume !!(#t~post6 < 2);havoc #t~post6; {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:27:01,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:27:01,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {1387#(or (= (+ (* (- 1) main_~b~0 main_~a~0) (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (* main_~b~0 main_~a~0)) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1364#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:27:01,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1267#(not (= |assume_abort_if_not_#in~cond| 0))} {1237#true} #59#return; {1387#(or (= (+ (* (- 1) main_~b~0 main_~a~0) (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (* main_~b~0 main_~a~0)) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:01,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:01,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:01,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#true} ~cond := #in~cond; {1400#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:27:01,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {1237#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret7 := main(); {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #65#return; {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2022-04-27 14:27:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:27:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142136314] [2022-04-27 14:27:01,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000737822] [2022-04-27 14:27:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000737822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:27:01,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:27:01,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-04-27 14:27:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077342442] [2022-04-27 14:27:01,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:27:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2022-04-27 14:27:01,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:01,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:27:01,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 14:27:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 14:27:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:27:01,904 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:27:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:04,371 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 14:27:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:27:04,371 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2022-04-27 14:27:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:27:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-27 14:27:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:27:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-27 14:27:04,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 73 transitions. [2022-04-27 14:27:04,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:04,456 INFO L225 Difference]: With dead ends: 67 [2022-04-27 14:27:04,456 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:27:04,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2022-04-27 14:27:04,457 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:04,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 186 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 14:27:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:27:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-27 14:27:04,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:04,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,477 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,477 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:04,480 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 14:27:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:27:04,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:04,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:04,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 60 states. [2022-04-27 14:27:04,481 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 60 states. [2022-04-27 14:27:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:04,483 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 14:27:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 14:27:04,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:04,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:04,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:04,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2022-04-27 14:27:04,486 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 28 [2022-04-27 14:27:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:04,486 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2022-04-27 14:27:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 14:27:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-27 14:27:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:27:04,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:04,487 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:04,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:04,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:04,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1513703477, now seen corresponding path program 1 times [2022-04-27 14:27:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:04,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222593537] [2022-04-27 14:27:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:04,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:04,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939894528] [2022-04-27 14:27:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:04,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:04,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:27:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:04,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:27:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:04,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:07,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {1729#true} call ULTIMATE.init(); {1729#true} is VALID [2022-04-27 14:27:07,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1729#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1729#true} is VALID [2022-04-27 14:27:07,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {1729#true} assume true; {1729#true} is VALID [2022-04-27 14:27:07,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1729#true} {1729#true} #65#return; {1729#true} is VALID [2022-04-27 14:27:07,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {1729#true} call #t~ret7 := main(); {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {1729#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {1729#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1729#true} ~cond := #in~cond; {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {1729#true} assume !(0 == ~cond); {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {1729#true} assume true; {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1729#true} {1729#true} #59#return; {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1729#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1729#true} is VALID [2022-04-27 14:27:07,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1729#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1729#true} assume !!(#t~post6 < 2);havoc #t~post6; {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L272 TraceCheckUtils]: 14: Hoare triple {1729#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {1729#true} ~cond := #in~cond; {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1729#true} assume !(0 == ~cond); {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#true} assume true; {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1729#true} {1729#true} #61#return; {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#true} assume !!(0 != ~y~0); {1729#true} is VALID [2022-04-27 14:27:07,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1729#true} is VALID [2022-04-27 14:27:07,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1729#true} is VALID [2022-04-27 14:27:07,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1729#true} is VALID [2022-04-27 14:27:07,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#true} assume !!(#t~post6 < 2);havoc #t~post6; {1729#true} is VALID [2022-04-27 14:27:07,441 INFO L272 TraceCheckUtils]: 24: Hoare triple {1729#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1729#true} is VALID [2022-04-27 14:27:07,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#true} ~cond := #in~cond; {1809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:07,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {1809#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:07,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:09,445 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} {1729#true} #61#return; {1820#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-27 14:27:09,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {1820#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1824#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:27:09,446 INFO L272 TraceCheckUtils]: 30: Hoare triple {1824#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:09,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {1828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:09,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {1832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1730#false} is VALID [2022-04-27 14:27:09,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {1730#false} assume !false; {1730#false} is VALID [2022-04-27 14:27:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:27:09,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:27:28,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {1730#false} assume !false; {1730#false} is VALID [2022-04-27 14:27:28,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {1832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1730#false} is VALID [2022-04-27 14:27:28,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {1828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:28,841 INFO L272 TraceCheckUtils]: 30: Hoare triple {1824#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:28,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {1851#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1824#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:27:28,842 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} {1729#true} #61#return; {1851#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:27:28,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:28,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1864#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:28,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#true} ~cond := #in~cond; {1864#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:27:28,843 INFO L272 TraceCheckUtils]: 24: Hoare triple {1729#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1729#true} is VALID [2022-04-27 14:27:28,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#true} assume !!(#t~post6 < 2);havoc #t~post6; {1729#true} is VALID [2022-04-27 14:27:28,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {1729#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1729#true} is VALID [2022-04-27 14:27:28,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {1729#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1729#true} is VALID [2022-04-27 14:27:28,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1729#true} is VALID [2022-04-27 14:27:28,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {1729#true} assume !!(0 != ~y~0); {1729#true} is VALID [2022-04-27 14:27:28,845 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1729#true} {1729#true} #61#return; {1729#true} is VALID [2022-04-27 14:27:28,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#true} assume true; {1729#true} is VALID [2022-04-27 14:27:28,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {1729#true} assume !(0 == ~cond); {1729#true} is VALID [2022-04-27 14:27:28,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {1729#true} ~cond := #in~cond; {1729#true} is VALID [2022-04-27 14:27:28,845 INFO L272 TraceCheckUtils]: 14: Hoare triple {1729#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1729#true} is VALID [2022-04-27 14:27:28,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {1729#true} assume !!(#t~post6 < 2);havoc #t~post6; {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1729#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1729#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1729#true} {1729#true} #59#return; {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {1729#true} assume true; {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {1729#true} assume !(0 == ~cond); {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {1729#true} ~cond := #in~cond; {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {1729#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1729#true} is VALID [2022-04-27 14:27:28,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {1729#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1729#true} is VALID [2022-04-27 14:27:28,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {1729#true} call #t~ret7 := main(); {1729#true} is VALID [2022-04-27 14:27:28,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1729#true} {1729#true} #65#return; {1729#true} is VALID [2022-04-27 14:27:28,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {1729#true} assume true; {1729#true} is VALID [2022-04-27 14:27:28,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {1729#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1729#true} is VALID [2022-04-27 14:27:28,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {1729#true} call ULTIMATE.init(); {1729#true} is VALID [2022-04-27 14:27:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:27:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:28,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222593537] [2022-04-27 14:27:28,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:28,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939894528] [2022-04-27 14:27:28,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939894528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:27:28,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:27:28,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:27:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410434867] [2022-04-27 14:27:28,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:27:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 14:27:28,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:28,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:27:30,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:30,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:27:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:30,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:27:30,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:27:30,879 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:27:32,914 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-27 14:27:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:33,297 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-27 14:27:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:27:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 14:27:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:27:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-04-27 14:27:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:27:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-04-27 14:27:33,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2022-04-27 14:27:37,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:37,335 INFO L225 Difference]: With dead ends: 65 [2022-04-27 14:27:37,335 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:27:37,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:27:37,336 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:37,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 14:27:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:27:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-27 14:27:37,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:37,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:37,365 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:37,365 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:37,368 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:27:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:27:37,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:37,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:37,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 58 states. [2022-04-27 14:27:37,369 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 58 states. [2022-04-27 14:27:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:37,371 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-27 14:27:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-04-27 14:27:37,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:37,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:37,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:37,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-04-27 14:27:37,374 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 34 [2022-04-27 14:27:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:37,374 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-04-27 14:27:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:27:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-04-27 14:27:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 14:27:37,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:37,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:37,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:37,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:37,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:37,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1456887472, now seen corresponding path program 2 times [2022-04-27 14:27:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:37,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456776449] [2022-04-27 14:27:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:37,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:37,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008160755] [2022-04-27 14:27:37,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:27:37,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:37,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:37,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:37,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:27:37,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:27:37,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:27:37,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:27:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:27:37,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:27:37,688 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:27:37,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:27:37,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:37,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:37,914 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:37,917 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:27:37,938 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:27:37,938 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:27:37,938 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:27:37,939 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:27:37,939 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:27:37,939 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:27:37,939 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:27:37,939 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:27:37,939 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:27:37,947 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:27:37,947 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:27:37,947 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:27:37,947 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:27:37,948 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-27 14:27:37,949 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:27:37,949 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:27:37,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:27:37 BoogieIcfgContainer [2022-04-27 14:27:37,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:27:37,951 INFO L158 Benchmark]: Toolchain (without parser) took 65781.57ms. Allocated memory was 196.1MB in the beginning and 251.7MB in the end (delta: 55.6MB). Free memory was 138.7MB in the beginning and 134.9MB in the end (delta: 3.8MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2022-04-27 14:27:37,951 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 196.1MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:27:37,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.30ms. Allocated memory was 196.1MB in the beginning and 251.7MB in the end (delta: 55.6MB). Free memory was 138.5MB in the beginning and 222.9MB in the end (delta: -84.5MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-04-27 14:27:37,952 INFO L158 Benchmark]: Boogie Preprocessor took 25.45ms. Allocated memory is still 251.7MB. Free memory was 222.9MB in the beginning and 221.0MB in the end (delta: 2.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:27:37,952 INFO L158 Benchmark]: RCFGBuilder took 247.64ms. Allocated memory is still 251.7MB. Free memory was 221.0MB in the beginning and 209.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:27:37,952 INFO L158 Benchmark]: TraceAbstraction took 65280.30ms. Allocated memory is still 251.7MB. Free memory was 208.9MB in the beginning and 134.9MB in the end (delta: 74.0MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2022-04-27 14:27:37,954 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 196.1MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.30ms. Allocated memory was 196.1MB in the beginning and 251.7MB in the end (delta: 55.6MB). Free memory was 138.5MB in the beginning and 222.9MB in the end (delta: -84.5MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.45ms. Allocated memory is still 251.7MB. Free memory was 222.9MB in the beginning and 221.0MB in the end (delta: 2.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 247.64ms. Allocated memory is still 251.7MB. Free memory was 221.0MB in the beginning and 209.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 65280.30ms. Allocated memory is still 251.7MB. Free memory was 208.9MB in the beginning and 134.9MB in the end (delta: 74.0MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int counter = 0; VAL [\old(counter)=7, counter=0] [L22] int a, b; [L23] long long x, y, z; [L25] a = __VERIFIER_nondet_int() [L26] b = __VERIFIER_nondet_int() [L27] CALL assume_abort_if_not(b >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L27] RET assume_abort_if_not(b >= 1) VAL [\old(counter)=0, a=2, b=4, counter=0] [L29] x = a [L30] y = b [L31] z = 0 VAL [\old(counter)=0, a=2, b=4, counter=0, x=2, y=4, z=0] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, b=4, counter=1, counter++=0, x=2, y=4, z=0] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(counter)=0, a=2, b=4, counter=1, x=2, y=4, z=0] [L35] COND FALSE !(!(y != 0)) VAL [\old(counter)=0, a=2, b=4, counter=1, x=2, y=4, z=0] [L38] COND FALSE !(y % 2 == 1) VAL [\old(counter)=0, a=2, b=4, counter=1, x=2, y=4, z=0] [L42] x = 2 * x [L43] y = y / 2 VAL [\old(counter)=0, a=2, b=4, counter=1, x=4, y=2, z=0] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, b=4, counter=2, counter++=1, x=4, y=2, z=0] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L13] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(counter)=0, a=2, b=4, counter=2, x=4, y=2, z=0] [L35] COND FALSE !(!(y != 0)) VAL [\old(counter)=0, a=2, b=4, counter=2, x=4, y=2, z=0] [L38] COND FALSE !(y % 2 == 1) VAL [\old(counter)=0, a=2, b=4, counter=2, x=4, y=2, z=0] [L42] x = 2 * x [L43] y = y / 2 VAL [\old(counter)=0, a=2, b=4, counter=2, x=8, y=1, z=0] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, b=4, counter=3, counter++=2, x=8, y=1, z=0] [L33] COND FALSE !(counter++<2) [L45] CALL __VERIFIER_assert(z == (long long) a * b) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L13] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L15] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 641 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 474 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 167 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 986 SizeOfPredicates, 19 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 30/44 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 14:27:37,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...