/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/prod4br-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:11:00,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:11:00,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:11:00,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:11:00,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:11:00,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:11:00,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:11:00,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:11:00,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:11:00,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:11:00,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:11:00,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:11:00,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:11:00,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:11:00,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:11:00,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:11:00,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:11:00,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:11:00,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:11:00,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:11:00,143 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:11:00,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:11:00,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:11:00,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:11:00,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:11:00,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:11:00,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:11:00,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:11:00,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:11:00,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:11:00,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:11:00,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:11:00,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:11:00,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:11:00,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:11:00,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:11:00,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:11:00,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:11:00,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:11:00,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:11:00,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:11:00,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:11:00,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 15:11:00,195 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:11:00,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:11:00,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:11:00,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:11:00,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:11:00,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:11:00,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:11:00,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:11:00,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:11:00,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:11:00,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:11:00,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:11:00,199 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:11:00,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:11:00,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:11:00,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 15:11:00,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:11:00,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:11:00,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:11:00,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:11:00,451 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:11:00,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-07 15:11:00,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612b31dcf/fb0d2ce235e34b1d96500c6d403bd84d/FLAGd8f9fdb90 [2022-04-07 15:11:00,903 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:11:00,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-07 15:11:00,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612b31dcf/fb0d2ce235e34b1d96500c6d403bd84d/FLAGd8f9fdb90 [2022-04-07 15:11:00,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612b31dcf/fb0d2ce235e34b1d96500c6d403bd84d [2022-04-07 15:11:00,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:11:00,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:11:00,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:11:00,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:11:00,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:11:00,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:11:00" (1/1) ... [2022-04-07 15:11:00,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b25b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:00, skipping insertion in model container [2022-04-07 15:11:00,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:11:00" (1/1) ... [2022-04-07 15:11:00,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:11:00,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:11:01,086 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/prod4br-ll_valuebound10.c[524,537] [2022-04-07 15:11:01,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:11:01,110 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:11:01,121 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/prod4br-ll_valuebound10.c[524,537] [2022-04-07 15:11:01,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:11:01,142 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:11:01,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01 WrapperNode [2022-04-07 15:11:01,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:11:01,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:11:01,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:11:01,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:11:01,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:11:01,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:11:01,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:11:01,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:11:01,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (1/1) ... [2022-04-07 15:11:01,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:11:01,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:11:01,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 15:11:01,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 15:11:01,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:11:01,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:11:01,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:11:01,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:11:01,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:11:01,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:11:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:11:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:11:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:11:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:11:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:11:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:11:01,286 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:11:01,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:11:01,564 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:11:01,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:11:01,571 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:11:01,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:11:01 BoogieIcfgContainer [2022-04-07 15:11:01,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:11:01,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:11:01,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:11:01,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:11:01,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:11:00" (1/3) ... [2022-04-07 15:11:01,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdf387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:11:01, skipping insertion in model container [2022-04-07 15:11:01,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:11:01" (2/3) ... [2022-04-07 15:11:01,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdf387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:11:01, skipping insertion in model container [2022-04-07 15:11:01,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:11:01" (3/3) ... [2022-04-07 15:11:01,595 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound10.c [2022-04-07 15:11:01,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:11:01,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:11:01,659 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:11:01,666 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 15:11:01,666 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:11:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:11:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:11:01,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:11:01,696 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-07 15:11:01,697 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:11:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:11:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-07 15:11:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:11:01,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871076278] [2022-04-07 15:11:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:11:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:11:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:01,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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); {37#true} is VALID [2022-04-07 15:11:01,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-07 15:11:01,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-07 15:11:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:11:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:01,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-07 15:11:01,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-07 15:11:01,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-07 15:11:01,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-07 15:11:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 15:11:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:01,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-07 15:11:01,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-07 15:11:01,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-07 15:11:01,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-07 15:11:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 15:11:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:01,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-07 15:11:01,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-07 15:11:01,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-07 15:11:01,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-07 15:11:01,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 15:11:01,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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); {37#true} is VALID [2022-04-07 15:11:01,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-07 15:11:01,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-07 15:11:01,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-07 15:11:01,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-07 15:11:01,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-07 15:11:01,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-07 15:11:01,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-07 15:11:01,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-07 15:11:01,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-07 15:11:01,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-07 15:11:01,919 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-07 15:11:01,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-07 15:11:01,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-07 15:11:01,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-07 15:11:01,920 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-07 15:11:01,920 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-07 15:11:01,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-07 15:11:01,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-07 15:11:01,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-07 15:11:01,922 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-07 15:11:01,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-07 15:11:01,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-07 15:11:01,922 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-07 15:11:01,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-07 15:11:01,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-07 15:11:01,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-07 15:11:01,923 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-07 15:11:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:11:01,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871076278] [2022-04-07 15:11:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871076278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:11:01,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:11:01,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:11:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586135391] [2022-04-07 15:11:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:11:01,931 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-07 15:11:01,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:11:01,935 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-07 15:11:01,959 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-07 15:11:01,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:11:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:11:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:11:01,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:11:01,980 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-07 15:11:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:02,092 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-07 15:11:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:11:02,092 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-07 15:11:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:11:02,094 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-07 15:11:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-07 15:11:02,102 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-07 15:11:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-07 15:11:02,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-07 15:11:02,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:02,209 INFO L225 Difference]: With dead ends: 61 [2022-04-07 15:11:02,209 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 15:11:02,212 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-07 15:11:02,214 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:11:02,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:11:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 15:11:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 15:11:02,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:11:02,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:11:02,241 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:11:02,241 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:11:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:02,245 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-07 15:11:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-07 15:11:02,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:02,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:02,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 15:11:02,247 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 15:11:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:02,250 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-07 15:11:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-07 15:11:02,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:02,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:02,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:11:02,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:11:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:11:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-07 15:11:02,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-07 15:11:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:11:02,255 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-07 15:11:02,256 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-07 15:11:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-07 15:11:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:11:02,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:11:02,257 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-07 15:11:02,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:11:02,257 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:11:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:11:02,258 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-07 15:11:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:11:02,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900393595] [2022-04-07 15:11:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:11:02,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:11:02,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619804661] [2022-04-07 15:11:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:02,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:11:02,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:11:02,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:11:02,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 15:11:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:02,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 15:11:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:02,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:11:02,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-07 15:11:02,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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); {239#true} is VALID [2022-04-07 15:11:02,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-07 15:11:02,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-07 15:11:02,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-07 15:11:02,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {239#true} is VALID [2022-04-07 15:11:02,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {239#true} is VALID [2022-04-07 15:11:02,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:11:02,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:02,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:02,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {239#true} #71#return; {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:02,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:02,837 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {239#true} is VALID [2022-04-07 15:11:02,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-07 15:11:02,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-07 15:11:02,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-07 15:11:02,839 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:02,839 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-07 15:11:02,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:11:02,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:02,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:02,841 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {276#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {310#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-07 15:11:02,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {310#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 15:11:02,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 15:11:02,844 INFO L272 TraceCheckUtils]: 24: Hoare triple {314#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:11:02,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:02,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-07 15:11:02,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-07 15:11:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:11:02,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:11:03,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-07 15:11:03,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-07 15:11:03,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:03,153 INFO L272 TraceCheckUtils]: 24: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:11:03,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-07 15:11:03,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {239#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-07 15:11:03,154 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {239#true} {239#true} #75#return; {239#true} is VALID [2022-04-07 15:11:03,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-07 15:11:03,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-07 15:11:03,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-07 15:11:03,155 INFO L272 TraceCheckUtils]: 17: Hoare triple {239#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-07 15:11:03,155 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {239#true} #73#return; {239#true} is VALID [2022-04-07 15:11:03,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-07 15:11:03,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-07 15:11:03,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-07 15:11:03,156 INFO L272 TraceCheckUtils]: 12: Hoare triple {239#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {239#true} is VALID [2022-04-07 15:11:03,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {239#true} is VALID [2022-04-07 15:11:03,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {239#true} {239#true} #71#return; {239#true} is VALID [2022-04-07 15:11:03,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-07 15:11:03,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-07 15:11:03,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-07 15:11:03,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {239#true} is VALID [2022-04-07 15:11:03,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {239#true} is VALID [2022-04-07 15:11:03,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-07 15:11:03,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-07 15:11:03,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-07 15:11:03,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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); {239#true} is VALID [2022-04-07 15:11:03,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-07 15:11:03,160 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-07 15:11:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:11:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900393595] [2022-04-07 15:11:03,161 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:11:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619804661] [2022-04-07 15:11:03,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619804661] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 15:11:03,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:11:03,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-07 15:11:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062012761] [2022-04-07 15:11:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:11:03,167 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-07 15:11:03,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:11:03,168 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-07 15:11:03,186 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-07 15:11:03,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:11:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:11:03,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:11:03,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:11:03,196 INFO L87 Difference]: Start difference. First operand 29 states and 36 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-07 15:11:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:03,542 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 15:11:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:11:03,542 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-07 15:11:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:11:03,543 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-07 15:11:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-07 15:11:03,545 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-07 15:11:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-07 15:11:03,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-07 15:11:03,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:03,662 INFO L225 Difference]: With dead ends: 35 [2022-04-07 15:11:03,662 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 15:11:03,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 15:11:03,664 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 15:11:03,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 15:11:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 15:11:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 15:11:03,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:11:03,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-07 15:11:03,671 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-07 15:11:03,671 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-07 15:11:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:03,673 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 15:11:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 15:11:03,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:03,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:03,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 33 states. [2022-04-07 15:11:03,675 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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 33 states. [2022-04-07 15:11:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:03,677 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 15:11:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 15:11:03,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:03,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:03,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:11:03,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:11:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-07 15:11:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-07 15:11:03,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-04-07 15:11:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:11:03,680 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-07 15:11:03,680 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-07 15:11:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 15:11:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 15:11:03,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:11:03,681 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-07 15:11:03,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 15:11:03,903 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-07 15:11:03,904 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:11:03,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:11:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-07 15:11:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:11:03,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999945200] [2022-04-07 15:11:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:11:03,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:11:03,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923366644] [2022-04-07 15:11:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:03,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:11:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:11:03,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:11:03,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 15:11:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:03,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 15:11:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:04,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:11:12,289 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 15:11:12,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2022-04-07 15:11:12,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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); {580#true} is VALID [2022-04-07 15:11:12,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:12,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} #83#return; {580#true} is VALID [2022-04-07 15:11:12,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} call #t~ret6 := main(); {580#true} is VALID [2022-04-07 15:11:12,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {580#true} is VALID [2022-04-07 15:11:12,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:12,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-07 15:11:12,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-07 15:11:12,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:12,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} #71#return; {580#true} is VALID [2022-04-07 15:11:12,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {580#true} is VALID [2022-04-07 15:11:12,912 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:12,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-07 15:11:12,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-07 15:11:12,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:12,912 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} #73#return; {580#true} is VALID [2022-04-07 15:11:12,912 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:12,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} ~cond := #in~cond; {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:11:12,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:12,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:12,921 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {580#true} #75#return; {650#(<= 1 main_~y~0)} is VALID [2022-04-07 15:11:12,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-07 15:11:12,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-07 15:11:12,922 INFO L272 TraceCheckUtils]: 24: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:12,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} ~cond := #in~cond; {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:12,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:11:12,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:11:14,935 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-07 15:11:14,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-07 15:11:14,937 INFO L272 TraceCheckUtils]: 30: Hoare triple {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:11:14,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:14,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-04-07 15:11:14,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-04-07 15:11:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:11:14,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:11:28,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-04-07 15:11:28,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-04-07 15:11:28,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:28,736 INFO L272 TraceCheckUtils]: 30: Hoare triple {703#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:11:28,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {707#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {703#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-07 15:11:28,739 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#true} #77#return; {707#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-07 15:11:28,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:11:28,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:11:28,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} ~cond := #in~cond; {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:11:28,740 INFO L272 TraceCheckUtils]: 24: Hoare triple {580#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:28,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {580#true} assume !false; {580#true} is VALID [2022-04-07 15:11:28,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {580#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {580#true} is VALID [2022-04-07 15:11:28,741 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {580#true} {580#true} #75#return; {580#true} is VALID [2022-04-07 15:11:28,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:28,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-07 15:11:28,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-07 15:11:28,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:28,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} #73#return; {580#true} is VALID [2022-04-07 15:11:28,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:28,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-07 15:11:28,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-07 15:11:28,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:28,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {580#true} is VALID [2022-04-07 15:11:28,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} #71#return; {580#true} is VALID [2022-04-07 15:11:28,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:28,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-07 15:11:28,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-07 15:11:28,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {580#true} is VALID [2022-04-07 15:11:28,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {580#true} is VALID [2022-04-07 15:11:28,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} call #t~ret6 := main(); {580#true} is VALID [2022-04-07 15:11:28,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} #83#return; {580#true} is VALID [2022-04-07 15:11:28,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-07 15:11:28,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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); {580#true} is VALID [2022-04-07 15:11:28,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2022-04-07 15:11:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:11:28,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:11:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999945200] [2022-04-07 15:11:28,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:11:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923366644] [2022-04-07 15:11:28,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923366644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:11:28,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:11:28,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-07 15:11:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989530433] [2022-04-07 15:11:28,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:11:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-07 15:11:28,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:11:28,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 15:11:30,782 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-07 15:11:30,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 15:11:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:11:30,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 15:11:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 15:11:30,784 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 15:11:32,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:11:38,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:11:40,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:11:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:41,201 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-07 15:11:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:11:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-07 15:11:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:11:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 15:11:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-07 15:11:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 15:11:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-07 15:11:41,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-07 15:11:41,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:41,300 INFO L225 Difference]: With dead ends: 49 [2022-04-07 15:11:41,300 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 15:11:41,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-07 15:11:41,301 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-07 15:11:41,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 279 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-04-07 15:11:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 15:11:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-04-07 15:11:41,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:11:41,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:41,319 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:41,319 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:41,322 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-07 15:11:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-07 15:11:41,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:41,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:41,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-07 15:11:41,323 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-07 15:11:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:41,326 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-07 15:11:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-07 15:11:41,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:41,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:41,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:11:41,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:11:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-07 15:11:41,329 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 34 [2022-04-07 15:11:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:11:41,329 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-07 15:11:41,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 15:11:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-07 15:11:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-07 15:11:41,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:11:41,331 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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-07 15:11:41,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 15:11:41,553 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-07 15:11:41,554 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:11:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:11:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash -624978355, now seen corresponding path program 1 times [2022-04-07 15:11:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:11:41,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34073129] [2022-04-07 15:11:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:11:41,584 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:11:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125078314] [2022-04-07 15:11:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:41,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:11:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:11:41,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:11:41,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 15:11:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:41,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 15:11:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:41,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:11:42,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-07 15:11:42,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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); {1025#true} is VALID [2022-04-07 15:11:42,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:42,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #83#return; {1025#true} is VALID [2022-04-07 15:11:42,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2022-04-07 15:11:42,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-07 15:11:42,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:42,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:11:42,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:42,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:42,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} {1025#true} #71#return; {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:42,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:42,062 INFO L272 TraceCheckUtils]: 12: Hoare triple {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:42,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:42,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:42,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:42,063 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1025#true} {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:42,063 INFO L272 TraceCheckUtils]: 17: Hoare triple {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:42,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:42,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:42,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:42,064 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1025#true} {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-07 15:11:42,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {1062#(and (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1099#(<= 0 main_~a~0)} is VALID [2022-04-07 15:11:42,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {1099#(<= 0 main_~a~0)} assume !false; {1099#(<= 0 main_~a~0)} is VALID [2022-04-07 15:11:42,065 INFO L272 TraceCheckUtils]: 24: Hoare triple {1099#(<= 0 main_~a~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:42,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:42,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:42,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:42,066 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1025#true} {1099#(<= 0 main_~a~0)} #77#return; {1099#(<= 0 main_~a~0)} is VALID [2022-04-07 15:11:42,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {1099#(<= 0 main_~a~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:42,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:42,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:42,068 INFO L272 TraceCheckUtils]: 32: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:42,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:42,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:42,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:42,069 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1025#true} {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:42,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L272 TraceCheckUtils]: 38: Hoare triple {1026#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {1026#false} assume !(0 == ~cond); {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {1026#false} assume true; {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1026#false} {1026#false} #79#return; {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L272 TraceCheckUtils]: 43: Hoare triple {1026#false} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-07 15:11:42,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {1026#false} assume 0 == ~cond; {1026#false} is VALID [2022-04-07 15:11:42,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-07 15:11:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:11:42,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:11:43,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-07 15:11:43,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {1026#false} assume 0 == ~cond; {1026#false} is VALID [2022-04-07 15:11:43,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-07 15:11:43,204 INFO L272 TraceCheckUtils]: 43: Hoare triple {1026#false} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1026#false} is VALID [2022-04-07 15:11:43,204 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1025#true} {1026#false} #79#return; {1026#false} is VALID [2022-04-07 15:11:43,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:43,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:43,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:43,205 INFO L272 TraceCheckUtils]: 38: Hoare triple {1026#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:43,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {1026#false} is VALID [2022-04-07 15:11:43,206 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1025#true} {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:43,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:43,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:43,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:43,206 INFO L272 TraceCheckUtils]: 32: Hoare triple {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:43,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:43,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-07 15:11:43,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1222#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-07 15:11:43,210 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1025#true} {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-07 15:11:43,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:43,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:43,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:43,210 INFO L272 TraceCheckUtils]: 24: Hoare triple {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:43,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-07 15:11:43,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-07 15:11:43,219 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1025#true} {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #75#return; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 15:11:43,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:43,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:43,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:43,224 INFO L272 TraceCheckUtils]: 17: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:43,225 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1025#true} {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #73#return; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 15:11:43,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:43,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-07 15:11:43,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-07 15:11:43,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:43,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 15:11:43,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} {1025#true} #71#return; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-07 15:11:43,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:43,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:43,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1294#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:11:43,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1025#true} is VALID [2022-04-07 15:11:43,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1025#true} is VALID [2022-04-07 15:11:43,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2022-04-07 15:11:43,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #83#return; {1025#true} is VALID [2022-04-07 15:11:43,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-07 15:11:43,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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); {1025#true} is VALID [2022-04-07 15:11:43,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-07 15:11:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 15:11:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:11:43,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34073129] [2022-04-07 15:11:43,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:11:43,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125078314] [2022-04-07 15:11:43,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125078314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:11:43,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:11:43,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-04-07 15:11:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974808959] [2022-04-07 15:11:43,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:11:43,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-07 15:11:43,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:11:43,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 15:11:43,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:43,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 15:11:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:11:43,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 15:11:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:11:43,285 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 15:11:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:43,668 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-07 15:11:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 15:11:43,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-07 15:11:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:11:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 15:11:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-07 15:11:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 15:11:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-07 15:11:43,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-07 15:11:43,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:43,716 INFO L225 Difference]: With dead ends: 51 [2022-04-07 15:11:43,716 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 15:11:43,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-07 15:11:43,719 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:11:43,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:11:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 15:11:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-07 15:11:43,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:11:43,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:43,745 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:43,745 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:43,747 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 15:11:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 15:11:43,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:43,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:43,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-07 15:11:43,748 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-07 15:11:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:43,750 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 15:11:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 15:11:43,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:43,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:43,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:11:43,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:11:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:11:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-07 15:11:43,753 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 47 [2022-04-07 15:11:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:11:43,753 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-07 15:11:43,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-07 15:11:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-07 15:11:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-07 15:11:43,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:11:43,754 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1] [2022-04-07 15:11:43,780 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-07 15:11:43,967 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-07 15:11:43,968 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:11:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:11:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2091386113, now seen corresponding path program 1 times [2022-04-07 15:11:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:11:43,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277799053] [2022-04-07 15:11:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:11:43,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:11:43,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294537686] [2022-04-07 15:11:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:11:43,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:11:43,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:11:43,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:11:44,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 15:11:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:44,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 15:11:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:11:44,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:11:44,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1535#true} is VALID [2022-04-07 15:11:44,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#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); {1535#true} is VALID [2022-04-07 15:11:44,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #83#return; {1535#true} is VALID [2022-04-07 15:11:44,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret6 := main(); {1535#true} is VALID [2022-04-07 15:11:44,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1535#true} is VALID [2022-04-07 15:11:44,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {1535#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#true} {1535#true} #71#return; {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1535#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L272 TraceCheckUtils]: 12: Hoare triple {1535#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {1535#true} ~cond := #in~cond; {1579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:11:44,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:44,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {1583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:11:44,336 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1583#(not (= |assume_abort_if_not_#in~cond| 0))} {1535#true} #73#return; {1590#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-07 15:11:44,336 INFO L272 TraceCheckUtils]: 17: Hoare triple {1590#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,337 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1535#true} {1590#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #75#return; {1590#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-07 15:11:44,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {1590#(and (<= 0 main_~y~0) (<= main_~y~0 10))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1609#(<= 0 main_~b~0)} is VALID [2022-04-07 15:11:44,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {1609#(<= 0 main_~b~0)} assume !false; {1609#(<= 0 main_~b~0)} is VALID [2022-04-07 15:11:44,338 INFO L272 TraceCheckUtils]: 24: Hoare triple {1609#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,339 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1535#true} {1609#(<= 0 main_~b~0)} #77#return; {1609#(<= 0 main_~b~0)} is VALID [2022-04-07 15:11:44,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= 0 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,345 INFO L272 TraceCheckUtils]: 33: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,350 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1535#true} {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} #77#return; {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,351 INFO L272 TraceCheckUtils]: 39: Hoare triple {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,352 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1535#true} {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #79#return; {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:11:44,353 INFO L272 TraceCheckUtils]: 44: Hoare triple {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:11:44,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:44,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {1682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1536#false} is VALID [2022-04-07 15:11:44,353 INFO L290 TraceCheckUtils]: 47: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-07 15:11:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 15:11:44,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:11:44,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-07 15:11:44,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {1682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1536#false} is VALID [2022-04-07 15:11:44,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:11:44,656 INFO L272 TraceCheckUtils]: 44: Hoare triple {1698#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:11:44,656 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1535#true} {1698#(= (* main_~b~0 main_~a~0) 0)} #79#return; {1698#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-07 15:11:44,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,657 INFO L272 TraceCheckUtils]: 39: Hoare triple {1698#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {1535#true} assume !(0 != ~a~0 && 0 != ~b~0); {1698#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-07 15:11:44,658 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1535#true} {1535#true} #77#return; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L272 TraceCheckUtils]: 33: Hoare triple {1535#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {1535#true} assume !false; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {1535#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {1535#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {1535#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1535#true} {1535#true} #77#return; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L272 TraceCheckUtils]: 24: Hoare triple {1535#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {1535#true} assume !false; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {1535#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1535#true} {1535#true} #75#return; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L272 TraceCheckUtils]: 17: Hoare triple {1535#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1535#true} {1535#true} #73#return; {1535#true} is VALID [2022-04-07 15:11:44,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {1535#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1535#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#true} {1535#true} #71#return; {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-07 15:11:44,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {1535#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret6 := main(); {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #83#return; {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#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); {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1535#true} is VALID [2022-04-07 15:11:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 15:11:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:11:44,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277799053] [2022-04-07 15:11:44,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:11:44,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294537686] [2022-04-07 15:11:44,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294537686] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 15:11:44,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:11:44,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-07 15:11:44,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128531143] [2022-04-07 15:11:44,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:11:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-07 15:11:44,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:11:44,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 15:11:44,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:44,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:11:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:11:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:11:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-07 15:11:44,691 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 15:11:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:44,998 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-07 15:11:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:11:44,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-07 15:11:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:11:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 15:11:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-07 15:11:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 15:11:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-07 15:11:45,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-07 15:11:45,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:11:45,054 INFO L225 Difference]: With dead ends: 38 [2022-04-07 15:11:45,054 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 15:11:45,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:11:45,056 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:11:45,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 15:11:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 15:11:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 15:11:45,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:11:45,059 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-07 15:11:45,059 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-07 15:11:45,059 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-07 15:11:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:45,059 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 15:11:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 15:11:45,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:45,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:45,059 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-07 15:11:45,059 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-07 15:11:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:11:45,060 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 15:11:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 15:11:45,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:45,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:11:45,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:11:45,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:11:45,060 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-07 15:11:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 15:11:45,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-07 15:11:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:11:45,060 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 15:11:45,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 15:11:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 15:11:45,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:11:45,063 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 15:11:45,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 15:11:45,283 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-07 15:11:45,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 60) no Hoare annotation was computed. [2022-04-07 15:11:47,501 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 60) no Hoare annotation was computed. [2022-04-07 15:11:47,502 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2022-04-07 15:11:47,502 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2022-04-07 15:11:47,502 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-07 15:11:47,502 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-07 15:11:47,502 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-07 15:11:47,502 INFO L878 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0)) [2022-04-07 15:11:47,502 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-07 15:11:47,502 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-07 15:11:47,502 INFO L882 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-07 15:11:47,502 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2022-04-07 15:11:47,502 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 0 main_~a~0) (<= 1 main_~y~0)) [2022-04-07 15:11:47,502 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 0 main_~a~0) (<= 1 main_~y~0)) [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 15:11:47,503 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-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 15:11:47,503 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-07 15:11:47,503 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-07 15:11:47,506 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 15:11:47,507 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 15:11:47,510 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 15:11:47,510 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-07 15:11:47,511 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-07 15:11:47,512 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-07 15:11:47,517 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 15:11:47,517 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 15:11:47,517 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 15:11:47,517 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 15:11:47,518 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-07 15:11:47,518 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-07 15:11:47,518 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 15:11:47,518 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 15:11:47,518 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 15:11:47,518 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 15:11:47,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 03:11:47 BoogieIcfgContainer [2022-04-07 15:11:47,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 15:11:47,526 INFO L158 Benchmark]: Toolchain (without parser) took 46602.41ms. Allocated memory was 177.2MB in the beginning and 237.0MB in the end (delta: 59.8MB). Free memory was 125.5MB in the beginning and 189.9MB in the end (delta: -64.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 15:11:47,526 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory was 142.0MB in the beginning and 141.8MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 15:11:47,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.72ms. Allocated memory is still 177.2MB. Free memory was 125.2MB in the beginning and 150.5MB in the end (delta: -25.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-07 15:11:47,527 INFO L158 Benchmark]: Boogie Preprocessor took 27.53ms. Allocated memory is still 177.2MB. Free memory was 150.5MB in the beginning and 148.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 15:11:47,527 INFO L158 Benchmark]: RCFGBuilder took 403.30ms. Allocated memory is still 177.2MB. Free memory was 148.9MB in the beginning and 136.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 15:11:47,527 INFO L158 Benchmark]: TraceAbstraction took 45948.84ms. Allocated memory was 177.2MB in the beginning and 237.0MB in the end (delta: 59.8MB). Free memory was 135.8MB in the beginning and 189.9MB in the end (delta: -54.1MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-04-07 15:11:47,528 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.12ms. Allocated memory is still 177.2MB. Free memory was 142.0MB in the beginning and 141.8MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.72ms. Allocated memory is still 177.2MB. Free memory was 125.2MB in the beginning and 150.5MB in the end (delta: -25.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.53ms. Allocated memory is still 177.2MB. Free memory was 150.5MB in the beginning and 148.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.30ms. Allocated memory is still 177.2MB. Free memory was 148.9MB in the beginning and 136.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 45948.84ms. Allocated memory was 177.2MB in the beginning and 237.0MB in the end (delta: 59.8MB). Free memory was 135.8MB in the beginning and 189.9MB in the end (delta: -54.1MB). Peak memory consumption was 6.2MB. 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: 14]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 527 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 140 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 27 PreInvPairs, 37 NumberOfFragments, 119 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 438 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 957 SizeOfPredicates, 18 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 173/196 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: (((x <= 10 && 0 <= x) && q + b * a * p == y * x) && 0 <= a) && 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-07 15:11:47,546 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...