/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_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:25:58,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:25:58,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:25:58,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:25:58,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:25:58,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:25:58,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:25:58,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:25:58,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:25:58,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:25:58,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:25:58,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:25:58,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:25:58,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:25:58,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:25:58,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:25:58,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:25:58,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:25:58,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:25:58,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:25:58,171 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:25:58,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:25:58,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:25:58,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:25:58,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:25:58,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:25:58,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:25:58,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:25:58,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:25:58,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:25:58,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:25:58,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:25:58,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:25:58,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:25:58,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:25:58,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:25:58,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:25:58,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:25:58,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:25:58,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:25:58,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:25:58,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:25:58,193 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-14 17:25:58,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:25:58,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:25:58,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:25:58,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:25:58,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:25:58,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:25:58,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:25:58,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:25:58,216 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:25:58,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:25:58,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:25:58,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:25:58,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:25:58,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:25:58,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:25:58,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:25:58,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:25:58,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:25:58,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:25:58,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:25:58,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:25:58,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:25:58,219 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:25:58,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:25:58,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:25:58,219 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-14 17:25:58,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:25:58,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:25:58,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:25:58,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:25:58,415 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:25:58,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-14 17:25:58,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dadbb2b/8e692fb34eab41d7a8f344d672e7f034/FLAG20a819c60 [2022-04-14 17:25:58,800 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:25:58,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-14 17:25:58,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dadbb2b/8e692fb34eab41d7a8f344d672e7f034/FLAG20a819c60 [2022-04-14 17:25:58,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03dadbb2b/8e692fb34eab41d7a8f344d672e7f034 [2022-04-14 17:25:58,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:25:58,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:25:58,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:25:58,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:25:58,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:25:58,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a57f89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58, skipping insertion in model container [2022-04-14 17:25:58,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:25:58,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:25:58,941 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_valuebound100.c[537,550] [2022-04-14 17:25:58,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:25:58,956 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:25:58,963 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_valuebound100.c[537,550] [2022-04-14 17:25:58,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:25:58,980 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:25:58,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58 WrapperNode [2022-04-14 17:25:58,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:25:58,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:25:58,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:25:58,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:25:58,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:58,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:25:59,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:25:59,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:25:59,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:25:59,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (1/1) ... [2022-04-14 17:25:59,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:25:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:25:59,021 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-14 17:25:59,037 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-14 17:25:59,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:25:59,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:25:59,049 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:25:59,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:25:59,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:25:59,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:25:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:25:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:25:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:25:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:25:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:25:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:25:59,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:25:59,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:25:59,223 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:25:59,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:25:59,229 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:25:59,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:25:59 BoogieIcfgContainer [2022-04-14 17:25:59,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:25:59,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:25:59,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:25:59,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:25:59,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:25:58" (1/3) ... [2022-04-14 17:25:59,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75405ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:25:59, skipping insertion in model container [2022-04-14 17:25:59,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:58" (2/3) ... [2022-04-14 17:25:59,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75405ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:25:59, skipping insertion in model container [2022-04-14 17:25:59,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:25:59" (3/3) ... [2022-04-14 17:25:59,242 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.c [2022-04-14 17:25:59,244 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:25:59,245 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:25:59,286 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:25:59,292 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 17:25:59,293 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:25:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:25:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 17:25:59,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:25:59,326 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:25:59,327 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:25:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:25:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-14 17:25:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:25:59,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680459626] [2022-04-14 17:25:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:25:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:25:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#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); {35#true} is VALID [2022-04-14 17:25:59,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-14 17:25:59,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-14 17:25:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 17:25:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:59,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:59,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:59,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-14 17:25:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 17:25:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:59,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:59,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:59,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-14 17:25:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 17:25:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:59,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:59,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:59,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-14 17:25:59,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:25:59,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#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); {35#true} is VALID [2022-04-14 17:25:59,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-14 17:25:59,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-14 17:25:59,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-14 17:25:59,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2022-04-14 17:25:59,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-14 17:25:59,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:59,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:59,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:59,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-14 17:25:59,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-14 17:25:59,564 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-14 17:25:59,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:59,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:59,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:59,566 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-14 17:25:59,566 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-14 17:25:59,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:59,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:59,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:59,567 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-14 17:25:59,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-14 17:25:59,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-14 17:25:59,568 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-14 17:25:59,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-14 17:25:59,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-14 17:25:59,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-14 17:25:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:25:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:25:59,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680459626] [2022-04-14 17:25:59,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680459626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:25:59,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:25:59,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:25:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106757817] [2022-04-14 17:25:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:25:59,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 17:25:59,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:25:59,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:59,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:59,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:25:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:25:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:25:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:25:59,639 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:59,758 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-14 17:25:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:25:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 17:25:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:25:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-14 17:25:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-14 17:25:59,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-14 17:25:59,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:59,852 INFO L225 Difference]: With dead ends: 57 [2022-04-14 17:25:59,853 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 17:25:59,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 17:25:59,859 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:25:59,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:25:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 17:25:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 17:25:59,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:25:59,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:59,881 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:59,881 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:59,884 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 17:25:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 17:25:59,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:59,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:59,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-14 17:25:59,885 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-14 17:25:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:59,887 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 17:25:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 17:25:59,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:59,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:59,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:25:59,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:25:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-14 17:25:59,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-14 17:25:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:25:59,891 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-14 17:25:59,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 17:25:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 17:25:59,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:25:59,892 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:25:59,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:25:59,892 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:25:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:25:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-14 17:25:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:25:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688781063] [2022-04-14 17:25:59,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:25:59,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:25:59,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532131535] [2022-04-14 17:25:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:25:59,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:25:59,943 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-14 17:25:59,946 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-14 17:25:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 17:25:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:00,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:26:00,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-14 17:26:00,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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); {224#true} is VALID [2022-04-14 17:26:00,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:26:00,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-14 17:26:00,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-14 17:26:00,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#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; {224#true} is VALID [2022-04-14 17:26:00,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {224#true} is VALID [2022-04-14 17:26:00,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-14 17:26:00,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-14 17:26:00,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:26:00,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-14 17:26:00,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-14 17:26:00,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {224#true} is VALID [2022-04-14 17:26:00,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-14 17:26:00,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-14 17:26:00,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:26:00,163 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-14 17:26:00,163 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-14 17:26:00,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-14 17:26:00,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-14 17:26:00,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:26:00,164 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-14 17:26:00,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:00,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:00,165 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(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)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:26:00,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:00,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-14 17:26:00,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-14 17:26:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:26:00,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:26:00,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:26:00,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688781063] [2022-04-14 17:26:00,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:26:00,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532131535] [2022-04-14 17:26:00,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532131535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:26:00,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:26:00,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:26:00,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416892432] [2022-04-14 17:26:00,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:26:00,169 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-14 17:26:00,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:26:00,169 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:26:00,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:26:00,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:26:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:26:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:26:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:26:00,185 INFO L87 Difference]: Start difference. First operand 27 states and 31 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:26:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:00,311 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-14 17:26:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:26:00,312 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-14 17:26:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:26:00,312 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:26:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-14 17:26:00,314 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:26:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-14 17:26:00,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-14 17:26:00,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:26:00,354 INFO L225 Difference]: With dead ends: 39 [2022-04-14 17:26:00,354 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 17:26:00,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-14 17:26:00,356 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:26:00,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:26:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 17:26:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-14 17:26:00,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:26:00,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:00,366 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:00,368 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:00,374 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 17:26:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 17:26:00,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:26:00,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:26:00,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-14 17:26:00,383 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-14 17:26:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:00,385 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 17:26:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 17:26:00,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:26:00,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:26:00,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:26:00,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:26:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-14 17:26:00,388 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-14 17:26:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:26:00,388 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-14 17:26:00,388 INFO L479 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:26:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-14 17:26:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 17:26:00,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:26:00,389 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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-14 17:26:00,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 17:26:00,606 WARN L460 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-14 17:26:00,607 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:26:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:26:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-14 17:26:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:26:00,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276877409] [2022-04-14 17:26:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:26:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:26:00,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:26:00,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544224629] [2022-04-14 17:26:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:26:00,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:26:00,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:26:00,639 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-14 17:26:00,657 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-14 17:26:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:00,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:26:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:00,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:26:00,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-14 17:26:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#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); {491#true} is VALID [2022-04-14 17:26:00,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:26:00,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-14 17:26:00,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-14 17:26:00,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#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; {491#true} is VALID [2022-04-14 17:26:00,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {491#true} is VALID [2022-04-14 17:26:00,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-14 17:26:00,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-14 17:26:00,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:26:00,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-14 17:26:00,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-14 17:26:00,815 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {491#true} is VALID [2022-04-14 17:26:00,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-14 17:26:00,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-14 17:26:00,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:26:00,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-14 17:26:00,815 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-14 17:26:00,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:26:00,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:26:00,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:26:00,818 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-14 17:26:00,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-14 17:26:00,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-14 17:26:00,819 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-14 17:26:00,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-14 17:26:00,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-14 17:26:00,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:26:00,820 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-14 17:26:00,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-14 17:26:00,820 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-14 17:26:00,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-14 17:26:00,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-14 17:26:00,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-14 17:26:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:26:00,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:26:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:26:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276877409] [2022-04-14 17:26:00,821 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:26:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544224629] [2022-04-14 17:26:00,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544224629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:26:00,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:26:00,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 17:26:00,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459057027] [2022-04-14 17:26:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:26:00,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 17:26:00,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:26:00,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:00,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:26:00,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 17:26:00,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:26:00,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 17:26:00,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:26:00,842 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:00,993 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-14 17:26:00,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 17:26:00,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 17:26:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:26:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 17:26:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 17:26:00,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-14 17:26:01,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:26:01,025 INFO L225 Difference]: With dead ends: 43 [2022-04-14 17:26:01,025 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 17:26:01,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-14 17:26:01,026 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:26:01,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:26:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 17:26:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-14 17:26:01,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:26:01,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:01,034 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:01,034 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:01,035 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 17:26:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 17:26:01,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:26:01,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:26:01,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-14 17:26:01,036 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-14 17:26:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:01,038 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 17:26:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 17:26:01,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:26:01,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:26:01,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:26:01,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:26:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:26:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-14 17:26:01,040 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-14 17:26:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:26:01,040 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-14 17:26:01,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 17:26:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 17:26:01,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:26:01,041 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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-14 17:26:01,071 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-14 17:26:01,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 17:26:01,247 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:26:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:26:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-14 17:26:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:26:01,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270054159] [2022-04-14 17:26:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:26:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:26:01,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:26:01,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384917449] [2022-04-14 17:26:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:26:01,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:26:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:26:01,278 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-14 17:26:01,279 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-14 17:26:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:01,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 17:26:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:01,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:26:02,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-14 17:26:02,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-14 17:26:02,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:02,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-14 17:26:02,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-14 17:26:02,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#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; {783#true} is VALID [2022-04-14 17:26:02,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:02,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-14 17:26:02,487 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:02,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:02,487 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-14 17:26:02,488 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:02,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:02,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:02,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:02,488 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-14 17:26:02,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:02,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:02,490 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(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)); {783#true} is VALID [2022-04-14 17:26:02,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:02,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:02,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:02,490 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:02,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:02,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:26:02,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~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); {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:26:02,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:26:02,986 INFO L272 TraceCheckUtils]: 33: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:26:02,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:02,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-14 17:26:02,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-14 17:26:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:26:02,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:26:27,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-14 17:26:27,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-14 17:26:27,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:27,756 INFO L272 TraceCheckUtils]: 33: Hoare triple {911#(= (+ 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)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:26:27,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:26:27,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#(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); {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:26:27,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} 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; {918#(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-14 17:26:27,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-14 17:26:27,764 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #67#return; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-14 17:26:27,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:27,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:27,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:27,764 INFO L272 TraceCheckUtils]: 24: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:27,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-14 17:26:28,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-14 17:26:28,090 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-14 17:26:28,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:28,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:28,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:28,090 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:28,090 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-14 17:26:28,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:28,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:28,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:28,091 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:28,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-14 17:26:28,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-14 17:26:28,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:28,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:28,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:28,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:28,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#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; {783#true} is VALID [2022-04-14 17:26:28,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-14 17:26:28,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-14 17:26:28,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:28,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-14 17:26:28,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-14 17:26:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:26:28,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:26:28,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270054159] [2022-04-14 17:26:28,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:26:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384917449] [2022-04-14 17:26:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384917449] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:26:28,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:26:28,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-14 17:26:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723470165] [2022-04-14 17:26:28,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:26:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-14 17:26:28,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:26:28,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:28,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:26:28,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 17:26:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:26:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 17:26:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:26:28,201 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:29,622 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-14 17:26:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 17:26:29,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-14 17:26:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:26:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-14 17:26:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-14 17:26:29,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-14 17:26:29,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:26:29,662 INFO L225 Difference]: With dead ends: 47 [2022-04-14 17:26:29,662 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 17:26:29,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-14 17:26:29,663 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 17:26:29,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 17:26:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 17:26:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-14 17:26:29,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:26:29,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:26:29,674 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:26:29,674 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:26:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:29,675 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:26:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:26:29,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:26:29,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:26:29,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-14 17:26:29,676 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-14 17:26:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:26:29,678 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:26:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:26:29,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:26:29,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:26:29,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:26:29,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:26:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:26:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-14 17:26:29,680 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2022-04-14 17:26:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:26:29,680 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-14 17:26:29,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:26:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-14 17:26:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 17:26:29,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:26:29,681 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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-14 17:26:29,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 17:26:29,891 WARN L460 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-14 17:26:29,892 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:26:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:26:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-14 17:26:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:26:29,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585778975] [2022-04-14 17:26:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:26:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:26:29,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:26:29,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308527037] [2022-04-14 17:26:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:26:29,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:26:29,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:26:29,910 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-14 17:26:29,911 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-14 17:26:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:29,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 17:26:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:26:29,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:26:31,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2022-04-14 17:26:31,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#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); {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #71#return; {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret6 := main(); {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#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; {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1236#true} {1236#true} #61#return; {1236#true} is VALID [2022-04-14 17:26:31,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1236#true} is VALID [2022-04-14 17:26:31,327 INFO L272 TraceCheckUtils]: 12: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:26:31,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-14 17:26:31,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-14 17:26:31,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-14 17:26:31,327 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2022-04-14 17:26:31,327 INFO L272 TraceCheckUtils]: 17: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:26:31,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#true} ~cond := #in~cond; {1295#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:26:31,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {1295#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:26:31,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:26:31,332 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} {1236#true} #65#return; {1306#(<= 1 main_~b~0)} is VALID [2022-04-14 17:26:31,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1306#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:31,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:31,333 INFO L272 TraceCheckUtils]: 24: Hoare triple {1310#(and (= main_~z~0 0) (= 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)); {1236#true} is VALID [2022-04-14 17:26:31,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {1236#true} ~cond := #in~cond; {1320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:31,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {1320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:26:31,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:26:31,334 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:31,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:31,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1310#(and (= main_~z~0 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)); {1337#(and (= main_~z~0 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-14 17:26:31,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {1337#(and (= main_~z~0 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); {1341#(and (= main_~z~0 0) (= 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))} is VALID [2022-04-14 17:26:31,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {1341#(and (= main_~z~0 0) (= 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))} assume !false; {1341#(and (= main_~z~0 0) (= 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))} is VALID [2022-04-14 17:26:31,338 INFO L272 TraceCheckUtils]: 33: Hoare triple {1341#(and (= main_~z~0 0) (= 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))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:26:31,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:31,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {1352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1237#false} is VALID [2022-04-14 17:26:31,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-04-14 17:26:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:26:31,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:27:07,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-04-14 17:27:07,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {1352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1237#false} is VALID [2022-04-14 17:27:07,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:07,428 INFO L272 TraceCheckUtils]: 33: Hoare triple {1368#(= (+ 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)); {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:27:07,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:27:07,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {1375#(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); {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:27:07,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#(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)); {1375#(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-14 17:27:07,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#(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); {1379#(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-14 17:27:07,436 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} #67#return; {1379#(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-14 17:27:07,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:07,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {1396#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:07,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {1236#true} ~cond := #in~cond; {1396#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:27:07,437 INFO L272 TraceCheckUtils]: 24: Hoare triple {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:27:07,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} assume !false; {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} is VALID [2022-04-14 17:27:07,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {1406#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} is VALID [2022-04-14 17:27:07,438 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} {1236#true} #65#return; {1406#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-14 17:27:07,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:27:07,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1419#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#true} ~cond := #in~cond; {1419#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 17:27:07,440 INFO L272 TraceCheckUtils]: 17: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L272 TraceCheckUtils]: 12: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1236#true} {1236#true} #61#return; {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-14 17:27:07,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#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; {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret6 := main(); {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #71#return; {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#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); {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2022-04-14 17:27:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:27:07,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:27:07,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585778975] [2022-04-14 17:27:07,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:27:07,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308527037] [2022-04-14 17:27:07,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308527037] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:27:07,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:27:07,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-14 17:27:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332226603] [2022-04-14 17:27:07,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:27:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-14 17:27:07,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:27:07,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:27:07,488 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-14 17:27:07,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-14 17:27:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:27:07,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-14 17:27:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-14 17:27:07,489 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:27:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:09,685 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-14 17:27:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-14 17:27:09,685 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-14 17:27:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:27:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:27:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-14 17:27:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:27:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-14 17:27:09,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-14 17:27:09,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:27:09,755 INFO L225 Difference]: With dead ends: 68 [2022-04-14 17:27:09,755 INFO L226 Difference]: Without dead ends: 61 [2022-04-14 17:27:09,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-14 17:27:09,756 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-14 17:27:09,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-14 17:27:09,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-14 17:27:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-14 17:27:09,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:27:09,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:09,777 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:09,777 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:09,779 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-14 17:27:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-14 17:27:09,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:27:09,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:27:09,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-14 17:27:09,780 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-14 17:27:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:09,783 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-14 17:27:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-14 17:27:09,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:27:09,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:27:09,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:27:09,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:27:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-14 17:27:09,785 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 37 [2022-04-14 17:27:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:27:09,785 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-14 17:27:09,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:27:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-14 17:27:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 17:27:09,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:27:09,786 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:27:09,803 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-14 17:27:09,999 WARN L460 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-14 17:27:09,999 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:27:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:27:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-14 17:27:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:27:10,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591517235] [2022-04-14 17:27:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:27:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:27:10,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:27:10,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773611793] [2022-04-14 17:27:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:27:10,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:27:10,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:27:10,014 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-14 17:27:10,015 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-14 17:27:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:27:10,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 17:27:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:27:10,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:27:18,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {1793#true} call ULTIMATE.init(); {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#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); {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1793#true} {1793#true} #71#return; {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1793#true} call #t~ret6 := main(); {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#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; {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {1793#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:18,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1793#true} {1793#true} #61#return; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {1793#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L272 TraceCheckUtils]: 12: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1793#true} {1793#true} #63#return; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:18,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1793#true} {1793#true} #65#return; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1793#true} {1793#true} #67#return; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {1793#true} assume !!(0 != ~y~0); {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {1793#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; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {1793#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); {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-14 17:27:18,228 INFO L272 TraceCheckUtils]: 33: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:18,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#true} ~cond := #in~cond; {1900#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:18,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {1900#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:18,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:20,239 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} {1793#true} #67#return; {1911#(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-14 17:27:20,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(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); {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:27:20,240 INFO L272 TraceCheckUtils]: 39: Hoare triple {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:27:20,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:20,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1794#false} is VALID [2022-04-14 17:27:20,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {1794#false} assume !false; {1794#false} is VALID [2022-04-14 17:27:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 17:27:20,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:27:31,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {1794#false} assume !false; {1794#false} is VALID [2022-04-14 17:27:31,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1794#false} is VALID [2022-04-14 17:27:31,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:31,989 INFO L272 TraceCheckUtils]: 39: Hoare triple {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:27:31,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {1942#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:27:31,990 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} {1793#true} #67#return; {1942#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-14 17:27:31,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:31,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {1955#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:31,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#true} ~cond := #in~cond; {1955#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:27:31,992 INFO L272 TraceCheckUtils]: 33: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:31,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-14 17:27:31,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {1793#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); {1793#true} is VALID [2022-04-14 17:27:31,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {1793#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; {1793#true} is VALID [2022-04-14 17:27:31,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {1793#true} assume !!(0 != ~y~0); {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1793#true} {1793#true} #67#return; {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1793#true} is VALID [2022-04-14 17:27:31,995 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1793#true} {1793#true} #65#return; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L272 TraceCheckUtils]: 17: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1793#true} {1793#true} #63#return; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L272 TraceCheckUtils]: 12: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1793#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1793#true} {1793#true} #61#return; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-14 17:27:31,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {1793#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-14 17:27:31,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#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; {1793#true} is VALID [2022-04-14 17:27:31,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {1793#true} call #t~ret6 := main(); {1793#true} is VALID [2022-04-14 17:27:31,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1793#true} {1793#true} #71#return; {1793#true} is VALID [2022-04-14 17:27:31,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-14 17:27:31,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#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); {1793#true} is VALID [2022-04-14 17:27:31,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1793#true} call ULTIMATE.init(); {1793#true} is VALID [2022-04-14 17:27:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 17:27:31,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:27:31,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591517235] [2022-04-14 17:27:31,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:27:31,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773611793] [2022-04-14 17:27:31,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773611793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:27:31,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:27:31,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 17:27:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164706687] [2022-04-14 17:27:31,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:27:32,000 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 17:27:32,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:27:32,001 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:27:34,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:27:34,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 17:27:34,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:27:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 17:27:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:27:34,026 INFO L87 Difference]: Start difference. First operand 61 states and 73 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:27:36,072 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-14 17:27:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:36,275 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-14 17:27:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 17:27:36,275 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 17:27:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:27:36,275 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:27:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-14 17:27:36,276 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:27:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-14 17:27:36,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-14 17:27:40,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 17:27:40,310 INFO L225 Difference]: With dead ends: 68 [2022-04-14 17:27:40,310 INFO L226 Difference]: Without dead ends: 61 [2022-04-14 17:27:40,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 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-14 17:27:40,310 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:27:40,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 17:27:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-14 17:27:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-14 17:27:40,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:27:40,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:40,334 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:40,334 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:40,336 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-14 17:27:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-14 17:27:40,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:27:40,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:27:40,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-14 17:27:40,336 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-14 17:27:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:40,338 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-14 17:27:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-14 17:27:40,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:27:40,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:27:40,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:27:40,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:27:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:27:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-04-14 17:27:40,340 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 43 [2022-04-14 17:27:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:27:40,340 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-04-14 17:27:40,340 INFO L479 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:27:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-14 17:27:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-14 17:27:40,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:27:40,341 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:27:40,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 17:27:40,555 WARN L460 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-14 17:27:40,555 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:27:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:27:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-14 17:27:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:27:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117376149] [2022-04-14 17:27:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:27:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:27:40,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:27:40,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834899353] [2022-04-14 17:27:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:27:40,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:27:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:27:40,567 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-14 17:27:40,568 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-14 17:27:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:27:40,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 17:27:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:27:40,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:28:12,829 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 17:28:39,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#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); {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #71#return; {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret6 := main(); {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#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; {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {2364#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2364#true} {2364#true} #61#return; {2364#true} is VALID [2022-04-14 17:28:39,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {2364#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L272 TraceCheckUtils]: 12: Hoare triple {2364#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2364#true} {2364#true} #63#return; {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L272 TraceCheckUtils]: 17: Hoare triple {2364#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-14 17:28:39,422 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2364#true} {2364#true} #65#return; {2364#true} is VALID [2022-04-14 17:28:39,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {2364#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-14 17:28:39,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {2435#(= main_~a~0 main_~x~0)} assume !false; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-14 17:28:39,423 INFO L272 TraceCheckUtils]: 24: Hoare triple {2435#(= main_~a~0 main_~x~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2364#true} is VALID [2022-04-14 17:28:39,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-14 17:28:39,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-14 17:28:39,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-14 17:28:39,424 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2364#true} {2435#(= main_~a~0 main_~x~0)} #67#return; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-14 17:28:39,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {2435#(= main_~a~0 main_~x~0)} assume !!(0 != ~y~0); {2457#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:28:39,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {2457#(and (not (= main_~y~0 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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2461#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:28:39,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {2461#(and (< 0 (+ main_~y~0 1)) (= 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); {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:28:39,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !false; {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:28:39,426 INFO L272 TraceCheckUtils]: 33: Hoare triple {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2364#true} is VALID [2022-04-14 17:28:39,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {2364#true} ~cond := #in~cond; {2475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:28:39,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:39,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:39,428 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} #67#return; {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:28:39,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:28:39,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:28:39,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~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); {2497#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} is VALID [2022-04-14 17:28:40,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {2497#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} assume !false; {2501#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:28:42,721 WARN L272 TraceCheckUtils]: 42: Hoare triple {2501#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2505#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-14 17:28:42,721 INFO L290 TraceCheckUtils]: 43: Hoare triple {2505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:28:42,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {2509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2365#false} is VALID [2022-04-14 17:28:42,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-14 17:28:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 17:28:42,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:29:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:29:02,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117376149] [2022-04-14 17:29:02,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:29:02,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834899353] [2022-04-14 17:29:02,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834899353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:29:02,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:29:02,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-14 17:29:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040444766] [2022-04-14 17:29:02,783 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:29:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-14 17:29:02,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:29:02,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:29:05,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:05,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 17:29:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:29:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 17:29:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2022-04-14 17:29:05,641 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:29:08,177 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-14 17:29:16,765 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-14 17:29:23,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:29:25,710 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-14 17:29:27,713 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-14 17:29:32,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:29:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:32,878 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-04-14 17:29:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 17:29:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-14 17:29:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:29:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:29:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-14 17:29:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:29:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-14 17:29:32,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-14 17:29:33,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:29:33,593 INFO L225 Difference]: With dead ends: 88 [2022-04-14 17:29:33,593 INFO L226 Difference]: Without dead ends: 86 [2022-04-14 17:29:33,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=66, Invalid=312, Unknown=2, NotChecked=0, Total=380 [2022-04-14 17:29:33,594 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:29:33,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 4 Unknown, 25 Unchecked, 14.1s Time] [2022-04-14 17:29:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-14 17:29:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-04-14 17:29:33,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:29:33,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:29:33,617 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:29:33,617 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:29:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:33,619 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-14 17:29:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-04-14 17:29:33,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:33,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:33,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-14 17:29:33,620 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-14 17:29:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:29:33,621 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-14 17:29:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-04-14 17:29:33,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:29:33,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:29:33,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:29:33,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:29:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:29:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-04-14 17:29:33,624 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 46 [2022-04-14 17:29:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:29:33,624 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-04-14 17:29:33,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:29:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-04-14 17:29:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 17:29:33,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:29:33,625 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:29:33,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 17:29:33,829 WARN L460 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-14 17:29:33,829 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:29:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:29:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-14 17:29:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:29:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310037158] [2022-04-14 17:29:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:29:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:29:33,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:29:33,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79203122] [2022-04-14 17:29:33,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:29:33,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:29:33,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:29:33,845 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-14 17:29:33,846 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-14 17:29:33,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:29:33,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:29:33,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-14 17:29:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:29:33,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:30:00,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-14 17:30:00,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#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); {2953#true} is VALID [2022-04-14 17:30:00,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:30:00,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #71#return; {2953#true} is VALID [2022-04-14 17:30:00,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret6 := main(); {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#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; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {2953#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2953#true} {2953#true} #61#return; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2953#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:30:00,931 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2953#true} {2953#true} #63#return; {2953#true} is VALID [2022-04-14 17:30:00,932 INFO L272 TraceCheckUtils]: 17: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:30:00,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:30:00,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:30:00,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:30:00,932 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2953#true} {2953#true} #65#return; {2953#true} is VALID [2022-04-14 17:30:00,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {2953#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3024#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:30:00,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {3024#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3024#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:30:00,941 INFO L272 TraceCheckUtils]: 24: Hoare triple {3024#(and (= 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)); {2953#true} is VALID [2022-04-14 17:30:00,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {2953#true} ~cond := #in~cond; {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:30:00,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:00,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:00,943 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3024#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {3045#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:30:00,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {3045#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3049#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:30:00,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {3049#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3053#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:30:00,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {3053#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~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); {3057#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:30:00,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {3057#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3057#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:30:00,949 INFO L272 TraceCheckUtils]: 33: Hoare triple {3057#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:30:00,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {2953#true} ~cond := #in~cond; {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:30:00,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:00,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:00,950 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3057#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3076#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:30:00,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {3076#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3080#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:30:00,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {3080#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} 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; {3084#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:30:00,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {3084#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~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); {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:30:00,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !false; {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:30:00,958 INFO L272 TraceCheckUtils]: 42: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:30:00,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {2953#true} ~cond := #in~cond; {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:30:00,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:00,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:00,959 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} #67#return; {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:30:00,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:30:00,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3113#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-14 17:30:00,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {3113#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~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); {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-14 17:30:00,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} assume !false; {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-14 17:30:02,179 INFO L272 TraceCheckUtils]: 51: Hoare triple {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:30:02,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:30:02,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-14 17:30:02,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-14 17:30:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 17:30:02,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:32:02,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-14 17:32:02,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-14 17:32:02,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:32:02,887 INFO L272 TraceCheckUtils]: 51: Hoare triple {3144#(= (+ 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)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:32:02,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:32:02,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {3151#(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); {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:32:02,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {3155#(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)); {3151#(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-14 17:32:02,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {3155#(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); {3155#(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-14 17:32:02,895 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} #67#return; {3155#(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-14 17:32:02,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:32:02,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {3172#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:32:02,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {2953#true} ~cond := #in~cond; {3172#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:32:02,896 INFO L272 TraceCheckUtils]: 42: Hoare triple {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:32:02,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} assume !false; {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} is VALID [2022-04-14 17:32:02,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {3182#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~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); {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)))} is VALID [2022-04-14 17:32:02,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {2953#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; {3182#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-14 17:32:02,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {2953#true} assume !!(0 != ~y~0); {2953#true} is VALID [2022-04-14 17:32:02,928 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2953#true} {2953#true} #67#return; {2953#true} is VALID [2022-04-14 17:32:02,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:32:02,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:32:02,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L272 TraceCheckUtils]: 33: Hoare triple {2953#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {2953#true} assume !false; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {2953#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); {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {2953#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; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {2953#true} assume !!(0 != ~y~0); {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2953#true} {2953#true} #67#return; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L272 TraceCheckUtils]: 24: Hoare triple {2953#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {2953#true} assume !false; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {2953#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2953#true} {2953#true} #65#return; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:32:02,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L272 TraceCheckUtils]: 17: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2953#true} {2953#true} #63#return; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L272 TraceCheckUtils]: 12: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {2953#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2953#true} {2953#true} #61#return; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {2953#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#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; {2953#true} is VALID [2022-04-14 17:32:02,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret6 := main(); {2953#true} is VALID [2022-04-14 17:32:02,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #71#return; {2953#true} is VALID [2022-04-14 17:32:02,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-14 17:32:02,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#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); {2953#true} is VALID [2022-04-14 17:32:02,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-14 17:32:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-14 17:32:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:32:02,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310037158] [2022-04-14 17:32:02,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:32:02,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79203122] [2022-04-14 17:32:02,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79203122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:32:02,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:32:02,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2022-04-14 17:32:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854098617] [2022-04-14 17:32:02,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:32:02,932 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-14 17:32:02,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:32:02,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:32:03,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:32:03,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-14 17:32:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:32:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-14 17:32:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=411, Unknown=2, NotChecked=0, Total=506 [2022-04-14 17:32:03,409 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:32:19,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:32:21,411 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-14 17:32:31,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:32:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:32:39,716 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2022-04-14 17:32:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-14 17:32:39,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-14 17:32:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:32:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:32:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2022-04-14 17:32:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:32:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2022-04-14 17:32:39,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 75 transitions. [2022-04-14 17:32:41,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:32:41,386 INFO L225 Difference]: With dead ends: 107 [2022-04-14 17:32:41,386 INFO L226 Difference]: Without dead ends: 105 [2022-04-14 17:32:41,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=172, Invalid=755, Unknown=3, NotChecked=0, Total=930 [2022-04-14 17:32:41,387 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:32:41,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 212 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 359 Invalid, 1 Unknown, 33 Unchecked, 13.0s Time] [2022-04-14 17:32:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-14 17:32:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2022-04-14 17:32:41,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:32:41,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:32:41,419 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:32:41,420 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:32:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:32:41,422 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-04-14 17:32:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2022-04-14 17:32:41,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:32:41,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:32:41,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 105 states. [2022-04-14 17:32:41,423 INFO L87 Difference]: Start difference. First operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand 105 states. [2022-04-14 17:32:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:32:41,425 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-04-14 17:32:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2022-04-14 17:32:41,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:32:41,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:32:41,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:32:41,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:32:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:32:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-04-14 17:32:41,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 55 [2022-04-14 17:32:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:32:41,427 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-04-14 17:32:41,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-14 17:32:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-04-14 17:32:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-14 17:32:41,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:32:41,428 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:32:41,444 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-14 17:32:41,644 WARN L460 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-14 17:32:41,644 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:32:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:32:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash -699618950, now seen corresponding path program 3 times [2022-04-14 17:32:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:32:41,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645062232] [2022-04-14 17:32:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:32:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:32:41,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:32:41,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470975588] [2022-04-14 17:32:41,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:32:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:32:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:32:41,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:32:41,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 17:32:41,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-14 17:32:41,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:32:41,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 17:32:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:32:41,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:33:06,607 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 17:33:10,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {3795#true} call ULTIMATE.init(); {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#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); {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3795#true} {3795#true} #71#return; {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {3795#true} call #t~ret6 := main(); {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {3795#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; {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L272 TraceCheckUtils]: 6: Hoare triple {3795#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:10,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:10,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:10,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3795#true} {3795#true} #61#return; {3795#true} is VALID [2022-04-14 17:33:10,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {3795#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3795#true} is VALID [2022-04-14 17:33:10,409 INFO L272 TraceCheckUtils]: 12: Hoare triple {3795#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {3795#true} ~cond := #in~cond; {3839#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:33:10,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {3839#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3843#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:33:10,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {3843#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3843#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:33:10,412 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3843#(not (= |assume_abort_if_not_#in~cond| 0))} {3795#true} #63#return; {3850#(and (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,412 INFO L272 TraceCheckUtils]: 17: Hoare triple {3850#(and (<= main_~b~0 100) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:10,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:10,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:10,413 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3795#true} {3850#(and (<= main_~b~0 100) (<= 0 main_~b~0))} #65#return; {3850#(and (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(and (<= main_~b~0 100) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} assume !false; {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,414 INFO L272 TraceCheckUtils]: 24: Hoare triple {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:10,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:10,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:10,414 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3795#true} {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} #67#return; {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {3869#(and (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3891#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {3891#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= main_~b~0 100) (<= 0 main_~b~0))} 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; {3895#(and (<= main_~b~0 (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {3895#(and (<= main_~b~0 (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~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); {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !false; {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,416 INFO L272 TraceCheckUtils]: 33: Hoare triple {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:10,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:10,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:10,417 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3795#true} {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} #67#return; {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {3899#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3921#(and (not (= main_~y~0 0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {3921#(and (not (= main_~y~0 0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3925#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {3925#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~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); {3929#(and (exists ((aux_div_v_main_~y~0_46_22 Int) (aux_mod_v_main_~y~0_46_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_46_22) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22 1)) (< aux_mod_v_main_~y~0_46_22 2) (<= (div (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_46_22 1)) (not (= (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 0)))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {3929#(and (exists ((aux_div_v_main_~y~0_46_22 Int) (aux_mod_v_main_~y~0_46_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_46_22) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22 1)) (< aux_mod_v_main_~y~0_46_22 2) (<= (div (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_46_22 1)) (not (= (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 0)))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,423 INFO L272 TraceCheckUtils]: 42: Hoare triple {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:10,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:10,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:10,423 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3795#true} {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} #67#return; {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-14 17:33:10,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {3933#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 100) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~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); {3958#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {3958#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !false; {3958#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,425 INFO L272 TraceCheckUtils]: 51: Hoare triple {3958#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:10,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {3795#true} ~cond := #in~cond; {3968#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:33:10,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {3968#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:33:10,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:33:10,444 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} {3958#(and (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} #67#return; {3979#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {3979#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3979#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {3979#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3986#(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 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:33:10,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {3986#(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 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~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); {3990#(and (exists ((aux_div_v_main_~y~0_48_22 Int) (aux_mod_v_main_~y~0_48_22 Int)) (and (not (= aux_mod_v_main_~y~0_48_22 1)) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22 1)) (< aux_mod_v_main_~y~0_48_22 2) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22) 2)) (<= 0 aux_mod_v_main_~y~0_48_22))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-14 17:33:12,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {3990#(and (exists ((aux_div_v_main_~y~0_48_22 Int) (aux_mod_v_main_~y~0_48_22 Int)) (and (not (= aux_mod_v_main_~y~0_48_22 1)) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22 1)) (< aux_mod_v_main_~y~0_48_22 2) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22) 2)) (<= 0 aux_mod_v_main_~y~0_48_22))) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {3994#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-14 17:33:12,899 INFO L272 TraceCheckUtils]: 60: Hoare triple {3994#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:33:12,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {3998#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:33:12,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {4002#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3796#false} is VALID [2022-04-14 17:33:12,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2022-04-14 17:33:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-14 17:33:12,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:33:46,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2022-04-14 17:33:46,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {4002#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3796#false} is VALID [2022-04-14 17:33:46,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {3998#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:33:46,838 INFO L272 TraceCheckUtils]: 60: Hoare triple {4018#(= (+ 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)); {3998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:33:46,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {4018#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4018#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:33:46,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {4025#(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); {4018#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:33:46,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {4029#(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)); {4025#(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-14 17:33:46,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {4029#(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); {4029#(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-14 17:33:46,857 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} {4036#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {4029#(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-14 17:33:46,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:33:46,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {4046#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3972#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:33:46,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {3795#true} ~cond := #in~cond; {4046#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:33:46,862 INFO L272 TraceCheckUtils]: 51: Hoare triple {4036#(or (<= 0 main_~y~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)); {3795#true} is VALID [2022-04-14 17:33:46,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {4036#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {4036#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-14 17:33:46,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 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); {4036#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-14 17:33:46,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:33:46,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:33:46,865 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3795#true} {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #67#return; {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:33:46,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:46,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:46,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:46,865 INFO L272 TraceCheckUtils]: 42: Hoare triple {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:46,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:33:46,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4056#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:33:46,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-14 17:33:46,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !!(0 != ~y~0); {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-14 17:33:46,869 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3795#true} {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} #67#return; {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-14 17:33:46,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:46,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:46,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:46,869 INFO L272 TraceCheckUtils]: 33: Hoare triple {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:46,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !false; {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-14 17:33:46,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {4112#(and (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 3) (div (+ (div main_~y~0 2) (- 10)) 2)) 2)) 2))) (or (<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 11) (div main_~y~0 2)) 2) (- 3)) 2)) 2) 3)) (not (= (mod main_~y~0 2) 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); {4084#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-14 17:33:46,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} 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; {4112#(and (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 3) (div (+ (div main_~y~0 2) (- 10)) 2)) 2)) 2))) (or (<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 11) (div main_~y~0 2)) 2) (- 3)) 2)) 2) 3)) (not (= (mod main_~y~0 2) 0))))} is VALID [2022-04-14 17:33:46,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} assume !!(0 != ~y~0); {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-14 17:33:46,874 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3795#true} {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} #67#return; {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-14 17:33:46,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:46,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:46,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:46,874 INFO L272 TraceCheckUtils]: 24: Hoare triple {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:46,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} assume !false; {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-14 17:33:46,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {4141#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4116#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-14 17:33:46,875 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3795#true} {4141#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} #65#return; {4141#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} is VALID [2022-04-14 17:33:46,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:46,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:46,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:46,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {4141#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:46,876 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3843#(not (= |assume_abort_if_not_#in~cond| 0))} {3795#true} #63#return; {4141#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} is VALID [2022-04-14 17:33:46,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {3843#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3843#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:33:46,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {4169#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3843#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:33:46,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {3795#true} ~cond := #in~cond; {4169#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 17:33:46,877 INFO L272 TraceCheckUtils]: 12: Hoare triple {3795#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:46,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {3795#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3795#true} {3795#true} #61#return; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {3795#true} assume !(0 == ~cond); {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3795#true} ~cond := #in~cond; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {3795#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {3795#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; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {3795#true} call #t~ret6 := main(); {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3795#true} {3795#true} #71#return; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {3795#true} assume true; {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#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); {3795#true} is VALID [2022-04-14 17:33:46,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {3795#true} call ULTIMATE.init(); {3795#true} is VALID [2022-04-14 17:33:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-14 17:33:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:33:46,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645062232] [2022-04-14 17:33:46,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:33:46,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470975588] [2022-04-14 17:33:46,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470975588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:33:46,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:33:46,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 33 [2022-04-14 17:33:46,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294848705] [2022-04-14 17:33:46,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:33:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64 [2022-04-14 17:33:46,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:33:46,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 17:33:49,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:33:49,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-14 17:33:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:33:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-14 17:33:49,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2022-04-14 17:33:49,777 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 17:33:53,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:34:22,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:34:27,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:34:29,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:34:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:34:53,114 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-14 17:34:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-14 17:34:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64 [2022-04-14 17:34:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:34:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 17:34:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 65 transitions. [2022-04-14 17:34:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 17:34:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 65 transitions. [2022-04-14 17:34:53,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 65 transitions. [2022-04-14 17:35:08,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 61 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-14 17:35:08,036 INFO L225 Difference]: With dead ends: 105 [2022-04-14 17:35:08,036 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 17:35:08,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=514, Invalid=1935, Unknown=1, NotChecked=0, Total=2450 [2022-04-14 17:35:08,037 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-14 17:35:08,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 212 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 330 Invalid, 0 Unknown, 43 Unchecked, 13.6s Time] [2022-04-14 17:35:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 17:35:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 17:35:08,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:35:08,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:35:08,038 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:35:08,038 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:35:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:35:08,038 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:35:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:35:08,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:35:08,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:35:08,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 17:35:08,038 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 17:35:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:35:08,039 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:35:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:35:08,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:35:08,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:35:08,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:35:08,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:35:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:35:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 17:35:08,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-04-14 17:35:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:35:08,039 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 17:35:08,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-14 17:35:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:35:08,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:35:08,041 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 17:35:08,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 17:35:08,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-14 17:35:08,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 17:35:15,149 WARN L232 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 156 DAG size of output: 17 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-14 17:35:19,819 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-14 17:35:19,819 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-14 17:35:19,819 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~b~0 100) (<= 0 main_~b~0)) [2022-04-14 17:35:19,819 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-14 17:35:19,819 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (and (<= 0 main_~y~0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (<= 1 main_~b~0)) [2022-04-14 17:35:19,820 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= main_~z~0 .cse0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= 1 main_~b~0))) [2022-04-14 17:35:19,820 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~y~0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 100) (<= 1 main_~b~0)) [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:35:19,820 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 17:35:19,821 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 17:35:19,821 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:35:19,821 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-14 17:35:19,821 INFO L882 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-14 17:35:19,821 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-14 17:35:19,821 INFO L882 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-14 17:35:19,821 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-14 17:35:19,821 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-14 17:35:19,823 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-04-14 17:35:19,824 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 17:35:19,825 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-14 17:35:19,826 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:35:19,827 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-14 17:35:19,830 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 17:35:19,830 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 17:35:19,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 05:35:19 BoogieIcfgContainer [2022-04-14 17:35:19,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 17:35:19,836 INFO L158 Benchmark]: Toolchain (without parser) took 561018.55ms. Allocated memory was 188.7MB in the beginning and 227.5MB in the end (delta: 38.8MB). Free memory was 136.7MB in the beginning and 88.0MB in the end (delta: 48.7MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. [2022-04-14 17:35:19,836 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 17:35:19,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.55ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 163.6MB in the end (delta: -27.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-14 17:35:19,836 INFO L158 Benchmark]: Boogie Preprocessor took 18.45ms. Allocated memory is still 188.7MB. Free memory was 163.6MB in the beginning and 162.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 17:35:19,837 INFO L158 Benchmark]: RCFGBuilder took 231.27ms. Allocated memory is still 188.7MB. Free memory was 162.0MB in the beginning and 150.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 17:35:19,839 INFO L158 Benchmark]: TraceAbstraction took 560603.37ms. Allocated memory was 188.7MB in the beginning and 227.5MB in the end (delta: 38.8MB). Free memory was 150.1MB in the beginning and 88.0MB in the end (delta: 62.0MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2022-04-14 17:35:19,840 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.08ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.55ms. Allocated memory is still 188.7MB. Free memory was 136.6MB in the beginning and 163.6MB in the end (delta: -27.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.45ms. Allocated memory is still 188.7MB. Free memory was 163.6MB in the beginning and 162.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.27ms. Allocated memory is still 188.7MB. Free memory was 162.0MB in the beginning and 150.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 560603.37ms. Allocated memory was 188.7MB in the beginning and 227.5MB in the end (delta: 38.8MB). Free memory was 150.1MB in the beginning and 88.0MB in the end (delta: 62.0MB). Peak memory consumption was 101.7MB. 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 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 560.5s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 154.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 44.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 1263 SdHoareTripleChecker+Invalid, 44.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 101 IncrementalHoareTripleChecker+Unchecked, 1041 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1483 IncrementalHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 222 mSDtfsCounter, 1483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 476 SyntacticMatches, 13 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 72.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=8, InterpolantAutomatonStates: 106, 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, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 35 PreInvPairs, 64 NumberOfFragments, 77 HoareAnnotationTreeSize, 35 FomulaSimplifications, 242 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2902 FormulaSimplificationTreeSizeReductionInter, 11.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 383.0s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 594 ConstructedInterpolants, 4 QuantifiedInterpolants, 4051 SizeOfPredicates, 29 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 326/443 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((0 <= y && z + y * x == b * a) && b <= 100) && 1 <= b RESULT: Ultimate proved your program to be correct! [2022-04-14 17:35:19,938 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...