./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound100.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 816a16e0673769de2fb3201d1b22101ddf5fd09f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:34:23,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:34:23,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:34:23,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:34:23,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:34:23,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:34:23,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:34:23,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:34:23,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:34:23,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:34:23,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:34:23,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:34:23,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:34:23,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:34:23,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:34:23,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:34:23,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:34:23,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:34:23,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:34:23,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:34:23,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:34:23,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:34:23,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:34:23,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:34:23,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:34:23,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:34:23,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:34:23,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:34:23,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:34:23,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:34:23,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:34:23,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:34:23,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:34:23,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:34:23,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:34:23,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:34:23,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:34:23,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:34:23,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:34:23,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:34:23,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:34:23,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:34:23,344 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:34:23,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:34:23,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:34:23,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:34:23,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:34:23,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:34:23,347 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:34:23,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:34:23,347 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:34:23,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:34:23,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:34:23,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:34:23,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:34:23,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:34:23,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:34:23,349 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:34:23,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:34:23,350 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:34:23,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:34:23,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:34:23,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:34:23,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:34:23,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:34:23,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:34:23,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:34:23,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:34:23,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:34:23,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:34:23,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:34:23,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:34:23,352 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 816a16e0673769de2fb3201d1b22101ddf5fd09f [2021-09-13 14:34:23,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:34:23,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:34:23,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:34:23,647 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:34:23,647 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:34:23,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound100.c [2021-09-13 14:34:23,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab7ed4db/eae7fd2f2bea451b8e7464901c27845d/FLAG655f62b20 [2021-09-13 14:34:24,092 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:34:24,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound100.c [2021-09-13 14:34:24,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab7ed4db/eae7fd2f2bea451b8e7464901c27845d/FLAG655f62b20 [2021-09-13 14:34:24,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab7ed4db/eae7fd2f2bea451b8e7464901c27845d [2021-09-13 14:34:24,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:34:24,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:34:24,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:34:24,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:34:24,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:34:24,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7d7dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24, skipping insertion in model container [2021-09-13 14:34:24,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:34:24,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:34:24,286 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound100.c[524,537] [2021-09-13 14:34:24,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:34:24,322 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:34:24,374 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound100.c[524,537] [2021-09-13 14:34:24,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:34:24,398 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:34:24,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24 WrapperNode [2021-09-13 14:34:24,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:34:24,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:34:24,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:34:24,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:34:24,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:34:24,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:34:24,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:34:24,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:34:24,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:34:24,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:34:24,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:34:24,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:34:24,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (1/1) ... [2021-09-13 14:34:24,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:34:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:34:24,510 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) [2021-09-13 14:34:24,520 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 [2021-09-13 14:34:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:34:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:34:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:34:24,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:34:24,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:34:24,859 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-09-13 14:34:24,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:34:24 BoogieIcfgContainer [2021-09-13 14:34:24,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:34:24,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:34:24,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:34:24,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:34:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:34:24" (1/3) ... [2021-09-13 14:34:24,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772f351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:34:24, skipping insertion in model container [2021-09-13 14:34:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:34:24" (2/3) ... [2021-09-13 14:34:24,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772f351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:34:24, skipping insertion in model container [2021-09-13 14:34:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:34:24" (3/3) ... [2021-09-13 14:34:24,866 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound100.c [2021-09-13 14:34:24,870 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:34:24,870 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-09-13 14:34:24,904 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:34:24,909 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:34:24,910 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-09-13 14:34:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.625) internal successors, (39), 27 states have internal predecessors, (39), 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) [2021-09-13 14:34:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:34:24,936 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:34:24,937 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:34:24,937 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:34:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:34:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2021-09-13 14:34:24,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:34:24,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903638925] [2021-09-13 14:34:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:24,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:34:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:25,105 INFO L281 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {31#true} is VALID [2021-09-13 14:34:25,106 INFO L281 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {31#true} is VALID [2021-09-13 14:34:25,108 INFO L281 TraceCheckUtils]: 2: Hoare triple {31#true} assume 0 == assume_abort_if_not_~cond;assume false; {32#false} is VALID [2021-09-13 14:34:25,108 INFO L281 TraceCheckUtils]: 3: Hoare triple {32#false} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {32#false} is VALID [2021-09-13 14:34:25,108 INFO L281 TraceCheckUtils]: 4: Hoare triple {32#false} assume 0 == assume_abort_if_not_~cond;assume false; {32#false} is VALID [2021-09-13 14:34:25,108 INFO L281 TraceCheckUtils]: 5: Hoare triple {32#false} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {32#false} is VALID [2021-09-13 14:34:25,109 INFO L281 TraceCheckUtils]: 6: Hoare triple {32#false} assume 0 == assume_abort_if_not_~cond;assume false; {32#false} is VALID [2021-09-13 14:34:25,109 INFO L281 TraceCheckUtils]: 7: Hoare triple {32#false} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {32#false} is VALID [2021-09-13 14:34:25,109 INFO L281 TraceCheckUtils]: 8: Hoare triple {32#false} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {32#false} is VALID [2021-09-13 14:34:25,110 INFO L281 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == __VERIFIER_assert_~cond; {32#false} is VALID [2021-09-13 14:34:25,110 INFO L281 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2021-09-13 14:34:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:34:25,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:34:25,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903638925] [2021-09-13 14:34:25,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903638925] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:34:25,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:34:25,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:34:25,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454332019] [2021-09-13 14:34:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2021-09-13 14:34:25,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:34:25,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-09-13 14:34:25,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:34:25,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:34:25,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:34:25,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:34:25,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:34:25,185 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.625) internal successors, (39), 27 states have internal predecessors, (39), 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 has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-09-13 14:34:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:25,274 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2021-09-13 14:34:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:34:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2021-09-13 14:34:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:34:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-09-13 14:34:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2021-09-13 14:34:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-09-13 14:34:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2021-09-13 14:34:25,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2021-09-13 14:34:25,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:34:25,359 INFO L225 Difference]: With dead ends: 53 [2021-09-13 14:34:25,359 INFO L226 Difference]: Without dead ends: 24 [2021-09-13 14:34:25,361 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:34:25,364 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.47ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.85ms IncrementalHoareTripleChecker+Time [2021-09-13 14:34:25,370 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.47ms Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 31.85ms Time] [2021-09-13 14:34:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-09-13 14:34:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-09-13 14:34:25,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:34:25,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-09-13 14:34:25,427 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-09-13 14:34:25,427 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-09-13 14:34:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:25,430 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-09-13 14:34:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-09-13 14:34:25,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:25,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:25,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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 24 states. [2021-09-13 14:34:25,431 INFO L87 Difference]: Start difference. First operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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 24 states. [2021-09-13 14:34:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:25,434 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-09-13 14:34:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-09-13 14:34:25,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:25,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:25,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:34:25,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:34:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-09-13 14:34:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-09-13 14:34:25,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2021-09-13 14:34:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:34:25,449 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-09-13 14:34:25,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-09-13 14:34:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-09-13 14:34:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:34:25,450 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:34:25,450 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:34:25,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:34:25,451 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:34:25,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:34:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2021-09-13 14:34:25,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:34:25,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23465432] [2021-09-13 14:34:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:25,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:34:25,467 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:34:25,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211225143] [2021-09-13 14:34:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:25,481 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:34:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:34:25,493 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) [2021-09-13 14:34:25,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:34:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:25,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:34:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:25,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:34:25,841 INFO L281 TraceCheckUtils]: 0: Hoare triple {173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {173#true} is VALID [2021-09-13 14:34:25,841 INFO L281 TraceCheckUtils]: 1: Hoare triple {173#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {173#true} is VALID [2021-09-13 14:34:25,842 INFO L281 TraceCheckUtils]: 2: Hoare triple {173#true} assume !(0 == assume_abort_if_not_~cond); {173#true} is VALID [2021-09-13 14:34:25,842 INFO L281 TraceCheckUtils]: 3: Hoare triple {173#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {173#true} is VALID [2021-09-13 14:34:25,842 INFO L281 TraceCheckUtils]: 4: Hoare triple {173#true} assume !(0 == assume_abort_if_not_~cond); {173#true} is VALID [2021-09-13 14:34:25,842 INFO L281 TraceCheckUtils]: 5: Hoare triple {173#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {173#true} is VALID [2021-09-13 14:34:25,842 INFO L281 TraceCheckUtils]: 6: Hoare triple {173#true} assume !(0 == assume_abort_if_not_~cond); {173#true} is VALID [2021-09-13 14:34:25,845 INFO L281 TraceCheckUtils]: 7: Hoare triple {173#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {199#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:34:25,845 INFO L281 TraceCheckUtils]: 8: Hoare triple {199#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {203#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:34:25,846 INFO L281 TraceCheckUtils]: 9: Hoare triple {203#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {174#false} is VALID [2021-09-13 14:34:25,846 INFO L281 TraceCheckUtils]: 10: Hoare triple {174#false} assume !false; {174#false} is VALID [2021-09-13 14:34:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:34:25,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:34:25,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:34:25,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23465432] [2021-09-13 14:34:25,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:34:25,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211225143] [2021-09-13 14:34:25,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211225143] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:34:25,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:34:25,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:34:25,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728863614] [2021-09-13 14:34:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2021-09-13 14:34:25,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:34:25,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-09-13 14:34:25,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:34:25,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:34:25,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:34:25,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:34:25,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:34:25,863 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-09-13 14:34:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:26,058 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-09-13 14:34:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:34:26,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2021-09-13 14:34:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:34:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-09-13 14:34:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2021-09-13 14:34:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-09-13 14:34:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2021-09-13 14:34:26,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2021-09-13 14:34:26,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:34:26,126 INFO L225 Difference]: With dead ends: 41 [2021-09-13 14:34:26,126 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:34:26,127 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.99ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:34:26,130 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.71ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.48ms IncrementalHoareTripleChecker+Time [2021-09-13 14:34:26,131 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 2.71ms Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 75.48ms Time] [2021-09-13 14:34:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:34:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2021-09-13 14:34:26,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:34:26,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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) [2021-09-13 14:34:26,139 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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) [2021-09-13 14:34:26,139 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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) [2021-09-13 14:34:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:26,145 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-09-13 14:34:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-09-13 14:34:26,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:26,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:26,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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 39 states. [2021-09-13 14:34:26,147 INFO L87 Difference]: Start difference. First operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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 39 states. [2021-09-13 14:34:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:34:26,152 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-09-13 14:34:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-09-13 14:34:26,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:34:26,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:34:26,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:34:26,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:34:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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) [2021-09-13 14:34:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-09-13 14:34:26,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2021-09-13 14:34:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:34:26,157 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-09-13 14:34:26,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-09-13 14:34:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-09-13 14:34:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:34:26,160 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:34:26,160 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:34:26,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:34:26,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:34:26,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:34:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:34:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -937517175, now seen corresponding path program 1 times [2021-09-13 14:34:26,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:34:26,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004191922] [2021-09-13 14:34:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:26,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:34:26,388 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:34:26,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050173894] [2021-09-13 14:34:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:34:26,389 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:34:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:34:26,391 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) [2021-09-13 14:34:26,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:34:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:26,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 27 conjunts are in the unsatisfiable core [2021-09-13 14:34:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:34:26,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:35:10,305 INFO L281 TraceCheckUtils]: 0: Hoare triple {367#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {367#true} is VALID [2021-09-13 14:35:10,306 INFO L281 TraceCheckUtils]: 1: Hoare triple {367#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {375#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} is VALID [2021-09-13 14:35:10,307 INFO L281 TraceCheckUtils]: 2: Hoare triple {375#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} assume !(0 == assume_abort_if_not_~cond); {379#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:10,311 INFO L281 TraceCheckUtils]: 3: Hoare triple {379#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {383#(and (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< 100 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~y~0 0))) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:10,312 INFO L281 TraceCheckUtils]: 4: Hoare triple {383#(and (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< 100 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~y~0 0))) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {387#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:10,312 INFO L281 TraceCheckUtils]: 5: Hoare triple {387#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {391#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:10,313 INFO L281 TraceCheckUtils]: 6: Hoare triple {391#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {395#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:10,314 INFO L281 TraceCheckUtils]: 7: Hoare triple {395#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {399#(and (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:35:12,316 INFO L281 TraceCheckUtils]: 8: Hoare triple {399#(and (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {403#(and (or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0))))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~p~0 Int)) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))))))) (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is UNKNOWN [2021-09-13 14:35:12,317 INFO L281 TraceCheckUtils]: 9: Hoare triple {403#(and (or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0))))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~p~0 Int)) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))))))) (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {407#(and (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0)))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:35:12,318 INFO L281 TraceCheckUtils]: 10: Hoare triple {407#(and (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0)))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !(0 != main_~a~0 && 0 != main_~b~0); {411#(and (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:35:12,319 INFO L281 TraceCheckUtils]: 11: Hoare triple {411#(and (<= ULTIMATE.start_main_~q~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (<= 0 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {415#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:35:12,319 INFO L281 TraceCheckUtils]: 12: Hoare triple {415#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {368#false} is VALID [2021-09-13 14:35:12,320 INFO L281 TraceCheckUtils]: 13: Hoare triple {368#false} assume !false; {368#false} is VALID [2021-09-13 14:35:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:12,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:35:12,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:35:12,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004191922] [2021-09-13 14:35:12,320 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:35:12,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050173894] [2021-09-13 14:35:12,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050173894] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:35:12,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:35:12,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-13 14:35:12,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964753471] [2021-09-13 14:35:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) Word has length 14 [2021-09-13 14:35:12,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:35:12,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:35:14,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 13 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:14,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:35:14,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:35:14,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:35:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:35:14,339 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:35:20,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:35:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:23,539 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2021-09-13 14:35:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:35:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) Word has length 14 [2021-09-13 14:35:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:35:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:35:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2021-09-13 14:35:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:35:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2021-09-13 14:35:23,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 48 transitions. [2021-09-13 14:35:23,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:35:23,587 INFO L225 Difference]: With dead ends: 42 [2021-09-13 14:35:23,587 INFO L226 Difference]: Without dead ends: 40 [2021-09-13 14:35:23,588 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1302.75ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:35:23,589 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4295.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.09ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 4302.21ms IncrementalHoareTripleChecker+Time [2021-09-13 14:35:23,589 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 3.09ms Time], IncrementalHoareTripleChecker [12 Valid, 210 Invalid, 1 Unknown, 12 Unchecked, 4302.21ms Time] [2021-09-13 14:35:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-09-13 14:35:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2021-09-13 14:35:23,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:35:23,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 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) [2021-09-13 14:35:23,610 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 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) [2021-09-13 14:35:23,610 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 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) [2021-09-13 14:35:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:23,612 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2021-09-13 14:35:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2021-09-13 14:35:23,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:35:23,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:35:23,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 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 40 states. [2021-09-13 14:35:23,613 INFO L87 Difference]: Start difference. First operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 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 40 states. [2021-09-13 14:35:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:35:23,615 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2021-09-13 14:35:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2021-09-13 14:35:23,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:35:23,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:35:23,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:35:23,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:35:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 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) [2021-09-13 14:35:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-09-13 14:35:23,623 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 14 [2021-09-13 14:35:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:35:23,623 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-09-13 14:35:23,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:35:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-09-13 14:35:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:35:23,624 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:35:23,624 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:35:23,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:35:23,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-09-13 14:35:23,841 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:35:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:35:23,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1003041614, now seen corresponding path program 1 times [2021-09-13 14:35:23,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:35:23,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290824326] [2021-09-13 14:35:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:35:23,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:35:23,860 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:35:23,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [911577009] [2021-09-13 14:35:23,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:35:23,860 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:35:23,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:35:23,868 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) [2021-09-13 14:35:23,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:35:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:23,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2021-09-13 14:35:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:35:23,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:35:28,451 INFO L281 TraceCheckUtils]: 0: Hoare triple {598#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {598#true} is VALID [2021-09-13 14:35:28,452 INFO L281 TraceCheckUtils]: 1: Hoare triple {598#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {606#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} is VALID [2021-09-13 14:35:28,453 INFO L281 TraceCheckUtils]: 2: Hoare triple {606#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} assume !(0 == assume_abort_if_not_~cond); {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:28,453 INFO L281 TraceCheckUtils]: 3: Hoare triple {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:28,453 INFO L281 TraceCheckUtils]: 4: Hoare triple {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:28,454 INFO L281 TraceCheckUtils]: 5: Hoare triple {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:28,454 INFO L281 TraceCheckUtils]: 6: Hoare triple {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:35:28,455 INFO L281 TraceCheckUtils]: 7: Hoare triple {610#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:28,455 INFO L281 TraceCheckUtils]: 8: Hoare triple {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:28,456 INFO L281 TraceCheckUtils]: 9: Hoare triple {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:28,456 INFO L281 TraceCheckUtils]: 10: Hoare triple {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~a~0 && 0 != main_~b~0); {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:35:28,457 INFO L281 TraceCheckUtils]: 11: Hoare triple {626#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume 0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~a~0 := (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then 1 + main_~a~0 / 2 else main_~a~0 / 2);main_~b~0 := (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then 1 + main_~b~0 / 2 else main_~b~0 / 2);main_~p~0 := 4 * main_~p~0; {639#(and (= ULTIMATE.start_main_~p~0 4) (<= (mod ULTIMATE.start_main_~x~0 2) 0) (= ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~y~0 2)) (= (mod ULTIMATE.start_main_~y~0 2) 0) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~a~0 (div ULTIMATE.start_main_~x~0 2)))} is VALID [2021-09-13 14:35:28,459 INFO L281 TraceCheckUtils]: 12: Hoare triple {639#(and (= ULTIMATE.start_main_~p~0 4) (<= (mod ULTIMATE.start_main_~x~0 2) 0) (= ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~y~0 2)) (= (mod ULTIMATE.start_main_~y~0 2) 0) (= ULTIMATE.start_main_~q~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (= ULTIMATE.start_main_~a~0 (div ULTIMATE.start_main_~x~0 2)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {643#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:35:28,459 INFO L281 TraceCheckUtils]: 13: Hoare triple {643#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {599#false} is VALID [2021-09-13 14:35:28,460 INFO L281 TraceCheckUtils]: 14: Hoare triple {599#false} assume !false; {599#false} is VALID [2021-09-13 14:35:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:35:28,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:36:31,531 INFO L281 TraceCheckUtils]: 14: Hoare triple {599#false} assume !false; {599#false} is VALID [2021-09-13 14:36:31,532 INFO L281 TraceCheckUtils]: 13: Hoare triple {643#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {599#false} is VALID [2021-09-13 14:36:31,533 INFO L281 TraceCheckUtils]: 12: Hoare triple {656#(= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {643#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:36:31,546 INFO L281 TraceCheckUtils]: 11: Hoare triple {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} assume 0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~a~0 := (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then 1 + main_~a~0 / 2 else main_~a~0 / 2);main_~b~0 := (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then 1 + main_~b~0 / 2 else main_~b~0 / 2);main_~p~0 := 4 * main_~p~0; {656#(= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0)))} is VALID [2021-09-13 14:36:31,547 INFO L281 TraceCheckUtils]: 10: Hoare triple {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} assume !!(0 != main_~a~0 && 0 != main_~b~0); {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} is VALID [2021-09-13 14:36:31,549 INFO L281 TraceCheckUtils]: 9: Hoare triple {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} assume !(0 == __VERIFIER_assert_~cond); {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} is VALID [2021-09-13 14:36:31,550 INFO L281 TraceCheckUtils]: 8: Hoare triple {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} is VALID [2021-09-13 14:36:31,555 INFO L281 TraceCheckUtils]: 7: Hoare triple {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {660#(or (and (< 0 (mod ULTIMATE.start_main_~a~0 2)) (<= 0 ULTIMATE.start_main_~a~0)) (and (or (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))))) (not (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (or (= (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2))) (* 4 (* ULTIMATE.start_main_~p~0 (div ULTIMATE.start_main_~b~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)))) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)))} is VALID [2021-09-13 14:36:31,555 INFO L281 TraceCheckUtils]: 6: Hoare triple {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:36:31,556 INFO L281 TraceCheckUtils]: 5: Hoare triple {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:36:31,557 INFO L281 TraceCheckUtils]: 4: Hoare triple {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:36:31,557 INFO L281 TraceCheckUtils]: 3: Hoare triple {686#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {673#(or (not (= (mod ULTIMATE.start_main_~y~0 2) 0)) (= (+ (* 4 (div ULTIMATE.start_main_~y~0 2)) (* 4 (* (div ULTIMATE.start_main_~y~0 2) (div ULTIMATE.start_main_~x~0 2)))) (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:36:31,558 INFO L281 TraceCheckUtils]: 2: Hoare triple {690#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {686#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:36:31,559 INFO L281 TraceCheckUtils]: 1: Hoare triple {598#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {690#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:36:31,559 INFO L281 TraceCheckUtils]: 0: Hoare triple {598#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {598#true} is VALID [2021-09-13 14:36:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:36:31,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:36:31,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290824326] [2021-09-13 14:36:31,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:36:31,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911577009] [2021-09-13 14:36:31,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911577009] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:36:31,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:36:31,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2021-09-13 14:36:31,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176857428] [2021-09-13 14:36:31,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) Word has length 15 [2021-09-13 14:36:31,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:36:31,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-09-13 14:36:31,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:31,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:36:31,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:36:31,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:36:31,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:36:31,599 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-09-13 14:36:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:34,181 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2021-09-13 14:36:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:36:34,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) Word has length 15 [2021-09-13 14:36:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:36:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-09-13 14:36:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2021-09-13 14:36:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-09-13 14:36:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2021-09-13 14:36:34,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2021-09-13 14:36:34,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:34,354 INFO L225 Difference]: With dead ends: 56 [2021-09-13 14:36:34,354 INFO L226 Difference]: Without dead ends: 54 [2021-09-13 14:36:34,355 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 951.17ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:36:34,356 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1069.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.32ms SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1071.84ms IncrementalHoareTripleChecker+Time [2021-09-13 14:36:34,356 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 2.32ms Time], IncrementalHoareTripleChecker [94 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1071.84ms Time] [2021-09-13 14:36:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-09-13 14:36:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 27. [2021-09-13 14:36:34,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:36:34,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-09-13 14:36:34,387 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-09-13 14:36:34,388 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-09-13 14:36:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:34,393 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2021-09-13 14:36:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2021-09-13 14:36:34,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:34,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:34,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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 54 states. [2021-09-13 14:36:34,394 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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 54 states. [2021-09-13 14:36:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:34,396 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2021-09-13 14:36:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2021-09-13 14:36:34,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:34,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:34,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:36:34,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:36:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-09-13 14:36:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-09-13 14:36:34,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2021-09-13 14:36:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:36:34,398 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-09-13 14:36:34,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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) [2021-09-13 14:36:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-09-13 14:36:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:36:34,399 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:36:34,399 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:36:34,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:36:34,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:36:34,614 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:36:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:36:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash 989284300, now seen corresponding path program 1 times [2021-09-13 14:36:34,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:36:34,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414981251] [2021-09-13 14:36:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:34,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:36:34,640 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:36:34,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840066222] [2021-09-13 14:36:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:34,641 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:36:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:36:34,642 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) [2021-09-13 14:36:34,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:36:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:34,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:36:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:34,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:36:34,865 INFO L281 TraceCheckUtils]: 0: Hoare triple {915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {915#true} is VALID [2021-09-13 14:36:34,865 INFO L281 TraceCheckUtils]: 1: Hoare triple {915#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {915#true} is VALID [2021-09-13 14:36:34,865 INFO L281 TraceCheckUtils]: 2: Hoare triple {915#true} assume !(0 == assume_abort_if_not_~cond); {915#true} is VALID [2021-09-13 14:36:34,866 INFO L281 TraceCheckUtils]: 3: Hoare triple {915#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {915#true} is VALID [2021-09-13 14:36:34,866 INFO L281 TraceCheckUtils]: 4: Hoare triple {915#true} assume !(0 == assume_abort_if_not_~cond); {915#true} is VALID [2021-09-13 14:36:34,866 INFO L281 TraceCheckUtils]: 5: Hoare triple {915#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {935#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:36:34,867 INFO L281 TraceCheckUtils]: 6: Hoare triple {935#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} assume !(0 == assume_abort_if_not_~cond); {939#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:36:34,867 INFO L281 TraceCheckUtils]: 7: Hoare triple {939#(<= 1 ULTIMATE.start_main_~y~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {943#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:34,867 INFO L281 TraceCheckUtils]: 8: Hoare triple {943#(<= 1 ULTIMATE.start_main_~b~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {943#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:34,868 INFO L281 TraceCheckUtils]: 9: Hoare triple {943#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {943#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:34,868 INFO L281 TraceCheckUtils]: 10: Hoare triple {943#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~a~0 && 0 != main_~b~0); {953#(and (= ULTIMATE.start_main_~a~0 0) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:36:34,869 INFO L281 TraceCheckUtils]: 11: Hoare triple {953#(and (= ULTIMATE.start_main_~a~0 0) (<= 1 ULTIMATE.start_main_~b~0))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {953#(and (= ULTIMATE.start_main_~a~0 0) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:36:34,869 INFO L281 TraceCheckUtils]: 12: Hoare triple {953#(and (= ULTIMATE.start_main_~a~0 0) (<= 1 ULTIMATE.start_main_~b~0))} assume !(0 == __VERIFIER_assert_~cond); {953#(and (= ULTIMATE.start_main_~a~0 0) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:36:34,869 INFO L281 TraceCheckUtils]: 13: Hoare triple {953#(and (= ULTIMATE.start_main_~a~0 0) (<= 1 ULTIMATE.start_main_~b~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 * main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {963#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:36:34,870 INFO L281 TraceCheckUtils]: 14: Hoare triple {963#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {916#false} is VALID [2021-09-13 14:36:34,870 INFO L281 TraceCheckUtils]: 15: Hoare triple {916#false} assume !false; {916#false} is VALID [2021-09-13 14:36:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:36:34,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:36:34,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:36:34,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414981251] [2021-09-13 14:36:34,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:36:34,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840066222] [2021-09-13 14:36:34,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840066222] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:36:34,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:36:34,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:36:34,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960618555] [2021-09-13 14:36:34,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 16 [2021-09-13 14:36:34,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:36:34,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:36:34,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:34,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:36:34,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:36:34,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:36:34,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:36:34,882 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:36:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:35,202 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-09-13 14:36:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:36:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 16 [2021-09-13 14:36:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:36:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:36:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2021-09-13 14:36:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:36:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2021-09-13 14:36:35,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2021-09-13 14:36:35,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:35,235 INFO L225 Difference]: With dead ends: 41 [2021-09-13 14:36:35,235 INFO L226 Difference]: Without dead ends: 35 [2021-09-13 14:36:35,236 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 118.30ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:36:35,236 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.78ms IncrementalHoareTripleChecker+Time [2021-09-13 14:36:35,237 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 91.78ms Time] [2021-09-13 14:36:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-09-13 14:36:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-09-13 14:36:35,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:36:35,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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) [2021-09-13 14:36:35,286 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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) [2021-09-13 14:36:35,286 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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) [2021-09-13 14:36:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:35,287 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-09-13 14:36:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:36:35,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:35,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:35,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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 35 states. [2021-09-13 14:36:35,288 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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 35 states. [2021-09-13 14:36:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:35,289 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-09-13 14:36:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:36:35,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:35,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:35,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:36:35,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:36:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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) [2021-09-13 14:36:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-09-13 14:36:35,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2021-09-13 14:36:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:36:35,291 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-09-13 14:36:35,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:36:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-09-13 14:36:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:36:35,292 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:36:35,292 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:36:35,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:36:35,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:36:35,501 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:36:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:36:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1530166964, now seen corresponding path program 1 times [2021-09-13 14:36:35,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:36:35,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906284953] [2021-09-13 14:36:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:35,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:36:35,513 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:36:35,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143790977] [2021-09-13 14:36:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:35,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:36:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:36:35,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:36:35,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:36:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:35,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:36:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:35,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:36:36,259 INFO L281 TraceCheckUtils]: 0: Hoare triple {1135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1135#true} is VALID [2021-09-13 14:36:36,259 INFO L281 TraceCheckUtils]: 1: Hoare triple {1135#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1135#true} is VALID [2021-09-13 14:36:36,259 INFO L281 TraceCheckUtils]: 2: Hoare triple {1135#true} assume !(0 == assume_abort_if_not_~cond); {1135#true} is VALID [2021-09-13 14:36:36,260 INFO L281 TraceCheckUtils]: 3: Hoare triple {1135#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1149#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< 100 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~y~0 0))) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100)))} is VALID [2021-09-13 14:36:36,261 INFO L281 TraceCheckUtils]: 4: Hoare triple {1149#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (or (< 100 ULTIMATE.start_main_~y~0) (< ULTIMATE.start_main_~y~0 0))) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100)))} assume !(0 == assume_abort_if_not_~cond); {1153#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))} is VALID [2021-09-13 14:36:36,262 INFO L281 TraceCheckUtils]: 5: Hoare triple {1153#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1153#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))} is VALID [2021-09-13 14:36:36,262 INFO L281 TraceCheckUtils]: 6: Hoare triple {1153#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))} assume !(0 == assume_abort_if_not_~cond); {1153#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))} is VALID [2021-09-13 14:36:36,263 INFO L281 TraceCheckUtils]: 7: Hoare triple {1153#(and (<= 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {1163#(and (<= 0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 100))} is VALID [2021-09-13 14:36:36,264 INFO L281 TraceCheckUtils]: 8: Hoare triple {1163#(and (<= 0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 100))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1163#(and (<= 0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 100))} is VALID [2021-09-13 14:36:36,264 INFO L281 TraceCheckUtils]: 9: Hoare triple {1163#(and (<= 0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 100))} assume !(0 == __VERIFIER_assert_~cond); {1163#(and (<= 0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 100))} is VALID [2021-09-13 14:36:36,265 INFO L281 TraceCheckUtils]: 10: Hoare triple {1163#(and (<= 0 ULTIMATE.start_main_~b~0) (<= ULTIMATE.start_main_~b~0 100))} assume !!(0 != main_~a~0 && 0 != main_~b~0); {1173#(and (<= 0 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 100) (not (= ULTIMATE.start_main_~a~0 0)))} is VALID [2021-09-13 14:36:36,266 INFO L281 TraceCheckUtils]: 11: Hoare triple {1173#(and (<= 0 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~b~0 0)) (<= ULTIMATE.start_main_~b~0 100) (not (= ULTIMATE.start_main_~a~0 0)))} assume 0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~a~0 := (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then 1 + main_~a~0 / 2 else main_~a~0 / 2);main_~b~0 := (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then 1 + main_~b~0 / 2 else main_~b~0 / 2);main_~p~0 := 4 * main_~p~0; {1177#(and (not (= (* 2 ULTIMATE.start_main_~a~0) 0)) (< 0 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:36:36,267 INFO L281 TraceCheckUtils]: 12: Hoare triple {1177#(and (not (= (* 2 ULTIMATE.start_main_~a~0) 0)) (< 0 ULTIMATE.start_main_~b~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1177#(and (not (= (* 2 ULTIMATE.start_main_~a~0) 0)) (< 0 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:36:36,268 INFO L281 TraceCheckUtils]: 13: Hoare triple {1177#(and (not (= (* 2 ULTIMATE.start_main_~a~0) 0)) (< 0 ULTIMATE.start_main_~b~0))} assume !(0 == __VERIFIER_assert_~cond); {1177#(and (not (= (* 2 ULTIMATE.start_main_~a~0) 0)) (< 0 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:36:36,268 INFO L281 TraceCheckUtils]: 14: Hoare triple {1177#(and (not (= (* 2 ULTIMATE.start_main_~a~0) 0)) (< 0 ULTIMATE.start_main_~b~0))} assume !(0 != main_~a~0 && 0 != main_~b~0); {1136#false} is VALID [2021-09-13 14:36:36,268 INFO L281 TraceCheckUtils]: 15: Hoare triple {1136#false} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1136#false} is VALID [2021-09-13 14:36:36,268 INFO L281 TraceCheckUtils]: 16: Hoare triple {1136#false} assume 0 == __VERIFIER_assert_~cond; {1136#false} is VALID [2021-09-13 14:36:36,269 INFO L281 TraceCheckUtils]: 17: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2021-09-13 14:36:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:36:36,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:36:36,691 INFO L281 TraceCheckUtils]: 17: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2021-09-13 14:36:36,692 INFO L281 TraceCheckUtils]: 16: Hoare triple {1136#false} assume 0 == __VERIFIER_assert_~cond; {1136#false} is VALID [2021-09-13 14:36:36,692 INFO L281 TraceCheckUtils]: 15: Hoare triple {1136#false} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1136#false} is VALID [2021-09-13 14:36:36,692 INFO L281 TraceCheckUtils]: 14: Hoare triple {1205#(and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)))} assume !(0 != main_~a~0 && 0 != main_~b~0); {1136#false} is VALID [2021-09-13 14:36:36,693 INFO L281 TraceCheckUtils]: 13: Hoare triple {1205#(and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {1205#(and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)))} is VALID [2021-09-13 14:36:36,693 INFO L281 TraceCheckUtils]: 12: Hoare triple {1205#(and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1205#(and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)))} is VALID [2021-09-13 14:36:36,694 INFO L281 TraceCheckUtils]: 11: Hoare triple {1215#(or (and (< 0 (mod ULTIMATE.start_main_~b~0 2)) (<= 0 ULTIMATE.start_main_~b~0)) (not (= 0 (mod ULTIMATE.start_main_~a~0 2))) (and (not (= (div ULTIMATE.start_main_~a~0 2) 0)) (< 0 (div ULTIMATE.start_main_~b~0 2))))} assume 0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~a~0 := (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then 1 + main_~a~0 / 2 else main_~a~0 / 2);main_~b~0 := (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then 1 + main_~b~0 / 2 else main_~b~0 / 2);main_~p~0 := 4 * main_~p~0; {1205#(and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)))} is VALID [2021-09-13 14:36:36,697 INFO L281 TraceCheckUtils]: 10: Hoare triple {1219#(<= 0 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~a~0 && 0 != main_~b~0); {1215#(or (and (< 0 (mod ULTIMATE.start_main_~b~0 2)) (<= 0 ULTIMATE.start_main_~b~0)) (not (= 0 (mod ULTIMATE.start_main_~a~0 2))) (and (not (= (div ULTIMATE.start_main_~a~0 2) 0)) (< 0 (div ULTIMATE.start_main_~b~0 2))))} is VALID [2021-09-13 14:36:36,697 INFO L281 TraceCheckUtils]: 9: Hoare triple {1219#(<= 0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {1219#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,698 INFO L281 TraceCheckUtils]: 8: Hoare triple {1219#(<= 0 ULTIMATE.start_main_~b~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1219#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,698 INFO L281 TraceCheckUtils]: 7: Hoare triple {1229#(<= 0 ULTIMATE.start_main_~y~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {1219#(<= 0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:36:36,698 INFO L281 TraceCheckUtils]: 6: Hoare triple {1229#(<= 0 ULTIMATE.start_main_~y~0)} assume !(0 == assume_abort_if_not_~cond); {1229#(<= 0 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:36:36,699 INFO L281 TraceCheckUtils]: 5: Hoare triple {1229#(<= 0 ULTIMATE.start_main_~y~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1229#(<= 0 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:36:36,699 INFO L281 TraceCheckUtils]: 4: Hoare triple {1239#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1229#(<= 0 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:36:36,699 INFO L281 TraceCheckUtils]: 3: Hoare triple {1135#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1239#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:36:36,700 INFO L281 TraceCheckUtils]: 2: Hoare triple {1135#true} assume !(0 == assume_abort_if_not_~cond); {1135#true} is VALID [2021-09-13 14:36:36,700 INFO L281 TraceCheckUtils]: 1: Hoare triple {1135#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1135#true} is VALID [2021-09-13 14:36:36,700 INFO L281 TraceCheckUtils]: 0: Hoare triple {1135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1135#true} is VALID [2021-09-13 14:36:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:36:36,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:36:36,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906284953] [2021-09-13 14:36:36,700 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:36:36,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143790977] [2021-09-13 14:36:36,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143790977] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:36:36,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:36:36,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-09-13 14:36:36,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154892953] [2021-09-13 14:36:36,701 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) Word has length 18 [2021-09-13 14:36:36,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:36:36,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2021-09-13 14:36:36,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:36,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:36:36,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:36:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:36:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:36:36,723 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2021-09-13 14:36:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:37,065 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2021-09-13 14:36:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:36:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) Word has length 18 [2021-09-13 14:36:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:36:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2021-09-13 14:36:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2021-09-13 14:36:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2021-09-13 14:36:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2021-09-13 14:36:37,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2021-09-13 14:36:37,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:36:37,099 INFO L225 Difference]: With dead ends: 48 [2021-09-13 14:36:37,099 INFO L226 Difference]: Without dead ends: 38 [2021-09-13 14:36:37,100 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 147.40ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:36:37,100 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.01ms IncrementalHoareTripleChecker+Time [2021-09-13 14:36:37,100 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 132 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 101.01ms Time] [2021-09-13 14:36:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-09-13 14:36:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2021-09-13 14:36:37,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:36:37,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:36:37,186 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:36:37,187 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:36:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:37,188 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-09-13 14:36:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2021-09-13 14:36:37,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:37,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:37,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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 38 states. [2021-09-13 14:36:37,189 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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 38 states. [2021-09-13 14:36:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:36:37,190 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-09-13 14:36:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2021-09-13 14:36:37,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:36:37,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:36:37,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:36:37,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:36:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:36:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-09-13 14:36:37,192 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2021-09-13 14:36:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:36:37,192 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-09-13 14:36:37,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) [2021-09-13 14:36:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:36:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:36:37,192 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:36:37,193 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:36:37,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:36:37,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:36:37,409 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:36:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:36:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1915371903, now seen corresponding path program 1 times [2021-09-13 14:36:37,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:36:37,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836364654] [2021-09-13 14:36:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:37,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:36:37,419 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:36:37,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059984027] [2021-09-13 14:36:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:36:37,419 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:36:37,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:36:37,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:36:37,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-09-13 14:36:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:37,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:36:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:36:37,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:37:19,775 INFO L281 TraceCheckUtils]: 0: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1437#true} is VALID [2021-09-13 14:37:19,776 INFO L281 TraceCheckUtils]: 1: Hoare triple {1437#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1437#true} is VALID [2021-09-13 14:37:19,782 INFO L281 TraceCheckUtils]: 2: Hoare triple {1437#true} assume !(0 == assume_abort_if_not_~cond); {1437#true} is VALID [2021-09-13 14:37:19,782 INFO L281 TraceCheckUtils]: 3: Hoare triple {1437#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1437#true} is VALID [2021-09-13 14:37:19,782 INFO L281 TraceCheckUtils]: 4: Hoare triple {1437#true} assume !(0 == assume_abort_if_not_~cond); {1437#true} is VALID [2021-09-13 14:37:19,782 INFO L281 TraceCheckUtils]: 5: Hoare triple {1437#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1437#true} is VALID [2021-09-13 14:37:19,782 INFO L281 TraceCheckUtils]: 6: Hoare triple {1437#true} assume !(0 == assume_abort_if_not_~cond); {1437#true} is VALID [2021-09-13 14:37:19,783 INFO L281 TraceCheckUtils]: 7: Hoare triple {1437#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {1437#true} is VALID [2021-09-13 14:37:19,783 INFO L281 TraceCheckUtils]: 8: Hoare triple {1437#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1437#true} is VALID [2021-09-13 14:37:19,783 INFO L281 TraceCheckUtils]: 9: Hoare triple {1437#true} assume !(0 == __VERIFIER_assert_~cond); {1437#true} is VALID [2021-09-13 14:37:19,785 INFO L281 TraceCheckUtils]: 10: Hoare triple {1437#true} assume !!(0 != main_~a~0 && 0 != main_~b~0); {1472#(not (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:37:19,785 INFO L281 TraceCheckUtils]: 11: Hoare triple {1472#(not (= ULTIMATE.start_main_~b~0 0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {1472#(not (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:37:19,786 INFO L281 TraceCheckUtils]: 12: Hoare triple {1472#(not (= ULTIMATE.start_main_~b~0 0))} assume 1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~a~0 := main_~a~0 - 1;main_~q~0 := main_~q~0 + main_~b~0 * main_~p~0; {1472#(not (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:37:21,788 INFO L281 TraceCheckUtils]: 13: Hoare triple {1472#(not (= ULTIMATE.start_main_~b~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1482#(and (or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0))))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~p~0 Int)) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))))))) (not (= ULTIMATE.start_main_~b~0 0)))} is UNKNOWN [2021-09-13 14:37:21,789 INFO L281 TraceCheckUtils]: 14: Hoare triple {1482#(and (or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0))))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~p~0 Int)) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))))))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {1486#(and (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0)))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:37:21,789 INFO L281 TraceCheckUtils]: 15: Hoare triple {1486#(and (or (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~a~0 0)))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 != main_~a~0 && 0 != main_~b~0); {1490#(= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:37:21,789 INFO L281 TraceCheckUtils]: 16: Hoare triple {1490#(= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1494#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:37:21,790 INFO L281 TraceCheckUtils]: 17: Hoare triple {1494#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1438#false} is VALID [2021-09-13 14:37:21,790 INFO L281 TraceCheckUtils]: 18: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2021-09-13 14:37:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:37:21,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:37:21,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:37:21,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836364654] [2021-09-13 14:37:21,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:37:21,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059984027] [2021-09-13 14:37:21,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059984027] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:37:21,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:37:21,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:37:21,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234550014] [2021-09-13 14:37:21,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 19 [2021-09-13 14:37:21,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:37:21,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-09-13 14:37:23,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:23,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:37:23,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:37:23,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:37:23,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:37:23,809 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-09-13 14:37:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:26,642 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-09-13 14:37:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:37:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 19 [2021-09-13 14:37:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:37:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-09-13 14:37:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2021-09-13 14:37:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-09-13 14:37:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2021-09-13 14:37:26,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2021-09-13 14:37:28,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:37:28,672 INFO L225 Difference]: With dead ends: 49 [2021-09-13 14:37:28,672 INFO L226 Difference]: Without dead ends: 45 [2021-09-13 14:37:28,673 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 164.21ms TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:37:28,673 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 343.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.41ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 344.33ms IncrementalHoareTripleChecker+Time [2021-09-13 14:37:28,674 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.41ms Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 10 Unchecked, 344.33ms Time] [2021-09-13 14:37:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-09-13 14:37:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2021-09-13 14:37:28,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:37:28,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:37:28,748 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:37:28,748 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:37:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:28,749 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-09-13 14:37:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-09-13 14:37:28,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:28,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:28,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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 45 states. [2021-09-13 14:37:28,750 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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 45 states. [2021-09-13 14:37:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:37:28,751 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-09-13 14:37:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-09-13 14:37:28,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:37:28,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:37:28,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:37:28,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:37:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:37:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-09-13 14:37:28,754 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 19 [2021-09-13 14:37:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:37:28,754 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-09-13 14:37:28,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2021-09-13 14:37:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:37:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:37:28,755 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:37:28,755 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:37:28,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-09-13 14:37:28,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:37:28,965 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:37:28,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:37:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1210343271, now seen corresponding path program 1 times [2021-09-13 14:37:28,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:37:28,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884688478] [2021-09-13 14:37:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:37:28,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:37:28,976 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:37:28,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691849250] [2021-09-13 14:37:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:37:28,978 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:37:28,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:37:28,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:37:28,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-09-13 14:37:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:29,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:37:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:37:29,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:38:11,040 INFO L281 TraceCheckUtils]: 0: Hoare triple {1701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1701#true} is VALID [2021-09-13 14:38:11,040 INFO L281 TraceCheckUtils]: 1: Hoare triple {1701#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1701#true} is VALID [2021-09-13 14:38:11,040 INFO L281 TraceCheckUtils]: 2: Hoare triple {1701#true} assume !(0 == assume_abort_if_not_~cond); {1701#true} is VALID [2021-09-13 14:38:11,040 INFO L281 TraceCheckUtils]: 3: Hoare triple {1701#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 4: Hoare triple {1701#true} assume !(0 == assume_abort_if_not_~cond); {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 5: Hoare triple {1701#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 6: Hoare triple {1701#true} assume !(0 == assume_abort_if_not_~cond); {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 7: Hoare triple {1701#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 8: Hoare triple {1701#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 9: Hoare triple {1701#true} assume !(0 == __VERIFIER_assert_~cond); {1701#true} is VALID [2021-09-13 14:38:11,041 INFO L281 TraceCheckUtils]: 10: Hoare triple {1701#true} assume !!(0 != main_~a~0 && 0 != main_~b~0); {1736#(not (= ULTIMATE.start_main_~a~0 0))} is VALID [2021-09-13 14:38:11,042 INFO L281 TraceCheckUtils]: 11: Hoare triple {1736#(not (= ULTIMATE.start_main_~a~0 0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {1736#(not (= ULTIMATE.start_main_~a~0 0))} is VALID [2021-09-13 14:38:11,042 INFO L281 TraceCheckUtils]: 12: Hoare triple {1736#(not (= ULTIMATE.start_main_~a~0 0))} assume !(1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {1736#(not (= ULTIMATE.start_main_~a~0 0))} is VALID [2021-09-13 14:38:11,042 INFO L281 TraceCheckUtils]: 13: Hoare triple {1736#(not (= ULTIMATE.start_main_~a~0 0))} assume 0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 1 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~b~0 := main_~b~0 - 1;main_~q~0 := main_~q~0 + main_~a~0 * main_~p~0; {1736#(not (= ULTIMATE.start_main_~a~0 0))} is VALID [2021-09-13 14:38:13,045 INFO L281 TraceCheckUtils]: 14: Hoare triple {1736#(not (= ULTIMATE.start_main_~a~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1749#(and (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~p~0 Int)) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0)))))) (and (or (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~b~0 0))) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (not (= ULTIMATE.start_main_~a~0 0)))} is UNKNOWN [2021-09-13 14:38:13,046 INFO L281 TraceCheckUtils]: 15: Hoare triple {1749#(and (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (exists ((ULTIMATE.start_main_~p~0 Int)) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0)))))) (and (or (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~b~0 0))) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (not (= ULTIMATE.start_main_~a~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {1753#(and (or (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~b~0 0))) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (not (= ULTIMATE.start_main_~a~0 0)))} is VALID [2021-09-13 14:38:13,046 INFO L281 TraceCheckUtils]: 16: Hoare triple {1753#(and (or (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~b~0 0))) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (not (= ULTIMATE.start_main_~a~0 0)))} assume !(0 != main_~a~0 && 0 != main_~b~0); {1757#(= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:38:13,047 INFO L281 TraceCheckUtils]: 17: Hoare triple {1757#(= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:38:13,047 INFO L281 TraceCheckUtils]: 18: Hoare triple {1761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1702#false} is VALID [2021-09-13 14:38:13,048 INFO L281 TraceCheckUtils]: 19: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2021-09-13 14:38:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:38:13,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:38:13,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:38:13,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884688478] [2021-09-13 14:38:13,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:38:13,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691849250] [2021-09-13 14:38:13,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691849250] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:38:13,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:38:13,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:38:13,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950378748] [2021-09-13 14:38:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:38:13,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:38:13,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-09-13 14:38:15,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:15,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:38:15,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:38:15,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:38:15,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:38:15,069 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-09-13 14:38:21,639 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:38:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:23,745 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2021-09-13 14:38:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:38:23,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:38:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:38:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-09-13 14:38:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2021-09-13 14:38:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-09-13 14:38:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2021-09-13 14:38:23,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2021-09-13 14:38:25,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:25,802 INFO L225 Difference]: With dead ends: 54 [2021-09-13 14:38:25,803 INFO L226 Difference]: Without dead ends: 52 [2021-09-13 14:38:25,803 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 103.62ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:38:25,804 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3226.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 3229.67ms IncrementalHoareTripleChecker+Time [2021-09-13 14:38:25,804 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 1 Unknown, 12 Unchecked, 3229.67ms Time] [2021-09-13 14:38:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-09-13 14:38:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2021-09-13 14:38:25,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:38:25,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:38:25,887 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:38:25,888 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:38:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:25,889 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-09-13 14:38:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2021-09-13 14:38:25,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:25,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:25,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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 52 states. [2021-09-13 14:38:25,890 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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 52 states. [2021-09-13 14:38:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:25,891 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-09-13 14:38:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2021-09-13 14:38:25,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:25,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:25,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:38:25,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:38:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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) [2021-09-13 14:38:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-09-13 14:38:25,893 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2021-09-13 14:38:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:38:25,894 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-09-13 14:38:25,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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) [2021-09-13 14:38:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:38:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:38:25,895 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:38:25,895 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:38:25,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:38:26,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:38:26,109 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:38:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:38:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash 564664091, now seen corresponding path program 1 times [2021-09-13 14:38:26,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:38:26,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195694817] [2021-09-13 14:38:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:26,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:38:26,119 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:38:26,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159808660] [2021-09-13 14:38:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:26,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:38:26,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:38:26,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:38:26,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-09-13 14:38:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:26,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjunts are in the unsatisfiable core [2021-09-13 14:38:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:26,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:38:47,996 INFO L281 TraceCheckUtils]: 0: Hoare triple {1987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1987#true} is VALID [2021-09-13 14:38:47,997 INFO L281 TraceCheckUtils]: 1: Hoare triple {1987#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1995#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} is VALID [2021-09-13 14:38:47,998 INFO L281 TraceCheckUtils]: 2: Hoare triple {1995#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} assume !(0 == assume_abort_if_not_~cond); {1999#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:47,998 INFO L281 TraceCheckUtils]: 3: Hoare triple {1999#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1999#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:47,999 INFO L281 TraceCheckUtils]: 4: Hoare triple {1999#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {1999#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:47,999 INFO L281 TraceCheckUtils]: 5: Hoare triple {1999#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2009#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:48,000 INFO L281 TraceCheckUtils]: 6: Hoare triple {2009#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {2013#(and (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:48,001 INFO L281 TraceCheckUtils]: 7: Hoare triple {2013#(and (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {2017#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:48,001 INFO L281 TraceCheckUtils]: 8: Hoare triple {2017#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2017#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:48,002 INFO L281 TraceCheckUtils]: 9: Hoare triple {2017#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2017#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:48,003 INFO L281 TraceCheckUtils]: 10: Hoare triple {2017#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !!(0 != main_~a~0 && 0 != main_~b~0); {2027#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:48,003 INFO L281 TraceCheckUtils]: 11: Hoare triple {2027#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2027#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:48,004 INFO L281 TraceCheckUtils]: 12: Hoare triple {2027#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !(1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2027#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:48,006 INFO L281 TraceCheckUtils]: 13: Hoare triple {2027#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~b~0) (<= 1 ULTIMATE.start_main_~p~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100) (<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~a~0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 1 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2));main_~a~0 := main_~a~0 - 1;main_~b~0 := main_~b~0 - 1;main_~q~0 := main_~q~0 + (1 + (main_~a~0 + main_~b~0)) * main_~p~0; {2037#(and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 1)) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 1)) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (<= 1 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:48,007 INFO L281 TraceCheckUtils]: 14: Hoare triple {2037#(and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 1)) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 1)) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (<= 1 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~p~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2041#(and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 1)) (exists ((ULTIMATE.start_main_~p~0 Int)) (and (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))))) (and (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (<= 1 ULTIMATE.start_main_~p~0))) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 1)) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:50,009 INFO L281 TraceCheckUtils]: 15: Hoare triple {2041#(and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 1)) (exists ((ULTIMATE.start_main_~p~0 Int)) (and (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))))) (and (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (<= 1 ULTIMATE.start_main_~p~0))) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 1)) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == __VERIFIER_assert_~cond); {2045#(and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 1)) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 1)) (or (and (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~b~0 0) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)) (<= 1 (div (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* (- 1) ULTIMATE.start_main_~q~0)) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0))))) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is UNKNOWN [2021-09-13 14:38:50,011 INFO L281 TraceCheckUtils]: 16: Hoare triple {2045#(and (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 1)) (<= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 1)) (or (and (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~b~0 0) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))) (and (= (mod (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 (- 1))) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0)) (<= 1 (div (+ (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* (- 1) ULTIMATE.start_main_~q~0)) (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0))))) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 != main_~a~0 && 0 != main_~b~0); {2049#(and (or (and (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (<= ULTIMATE.start_main_~y~0 1)) (and (<= ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:50,012 INFO L281 TraceCheckUtils]: 17: Hoare triple {2049#(and (or (and (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (<= ULTIMATE.start_main_~y~0 1)) (and (<= ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2053#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:38:50,012 INFO L281 TraceCheckUtils]: 18: Hoare triple {2053#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1988#false} is VALID [2021-09-13 14:38:50,012 INFO L281 TraceCheckUtils]: 19: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2021-09-13 14:38:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:38:50,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:38:50,217 INFO L281 TraceCheckUtils]: 19: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2021-09-13 14:38:50,217 INFO L281 TraceCheckUtils]: 18: Hoare triple {2053#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1988#false} is VALID [2021-09-13 14:38:50,218 INFO L281 TraceCheckUtils]: 17: Hoare triple {2066#(= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2053#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:38:50,218 INFO L281 TraceCheckUtils]: 16: Hoare triple {2070#(or (and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0))) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))} assume !(0 != main_~a~0 && 0 != main_~b~0); {2066#(= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:38:50,219 INFO L281 TraceCheckUtils]: 15: Hoare triple {2074#(or (and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))} assume !(0 == __VERIFIER_assert_~cond); {2070#(or (and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0))) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 14: Hoare triple {1987#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2074#(or (and (not (= ULTIMATE.start_main_~b~0 0)) (not (= ULTIMATE.start_main_~a~0 0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 13: Hoare triple {1987#true} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 1 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2));main_~a~0 := main_~a~0 - 1;main_~b~0 := main_~b~0 - 1;main_~q~0 := main_~q~0 + (1 + (main_~a~0 + main_~b~0)) * main_~p~0; {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 12: Hoare triple {1987#true} assume !(1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 11: Hoare triple {1987#true} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 10: Hoare triple {1987#true} assume !!(0 != main_~a~0 && 0 != main_~b~0); {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 9: Hoare triple {1987#true} assume !(0 == __VERIFIER_assert_~cond); {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 8: Hoare triple {1987#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 7: Hoare triple {1987#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 6: Hoare triple {1987#true} assume !(0 == assume_abort_if_not_~cond); {1987#true} is VALID [2021-09-13 14:38:50,221 INFO L281 TraceCheckUtils]: 5: Hoare triple {1987#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1987#true} is VALID [2021-09-13 14:38:50,222 INFO L281 TraceCheckUtils]: 4: Hoare triple {1987#true} assume !(0 == assume_abort_if_not_~cond); {1987#true} is VALID [2021-09-13 14:38:50,222 INFO L281 TraceCheckUtils]: 3: Hoare triple {1987#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1987#true} is VALID [2021-09-13 14:38:50,222 INFO L281 TraceCheckUtils]: 2: Hoare triple {1987#true} assume !(0 == assume_abort_if_not_~cond); {1987#true} is VALID [2021-09-13 14:38:50,222 INFO L281 TraceCheckUtils]: 1: Hoare triple {1987#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1987#true} is VALID [2021-09-13 14:38:50,222 INFO L281 TraceCheckUtils]: 0: Hoare triple {1987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1987#true} is VALID [2021-09-13 14:38:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:38:50,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:38:50,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195694817] [2021-09-13 14:38:50,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:38:50,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159808660] [2021-09-13 14:38:50,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159808660] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:38:50,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:38:50,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2021-09-13 14:38:50,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998338143] [2021-09-13 14:38:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:38:50,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:38:50,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:38:50,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:50,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:38:50,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:38:50,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:38:50,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:38:50,238 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:38:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:50,632 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-09-13 14:38:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:38:50,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:38:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:38:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:38:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2021-09-13 14:38:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:38:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2021-09-13 14:38:50,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2021-09-13 14:38:50,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:50,657 INFO L225 Difference]: With dead ends: 37 [2021-09-13 14:38:50,657 INFO L226 Difference]: Without dead ends: 35 [2021-09-13 14:38:50,658 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 394.62ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:38:50,658 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.51ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.61ms IncrementalHoareTripleChecker+Time [2021-09-13 14:38:50,658 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.51ms Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 164.61ms Time] [2021-09-13 14:38:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-09-13 14:38:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2021-09-13 14:38:50,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:38:50,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:50,727 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:50,727 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:50,728 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-09-13 14:38:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:38:50,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:50,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:50,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 35 states. [2021-09-13 14:38:50,729 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 35 states. [2021-09-13 14:38:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:50,730 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-09-13 14:38:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-09-13 14:38:50,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:50,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:50,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:38:50,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:38:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-09-13 14:38:50,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2021-09-13 14:38:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:38:50,732 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-09-13 14:38:50,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:38:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-09-13 14:38:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:38:50,733 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:38:50,733 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:38:50,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-09-13 14:38:50,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-09-13 14:38:50,945 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:38:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:38:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 796411100, now seen corresponding path program 1 times [2021-09-13 14:38:50,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:38:50,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547306145] [2021-09-13 14:38:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:50,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:38:50,955 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:38:50,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767891721] [2021-09-13 14:38:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:50,955 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:38:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:38:50,956 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:38:50,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-09-13 14:38:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:50,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:38:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:50,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:38:51,280 INFO L281 TraceCheckUtils]: 0: Hoare triple {2273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2273#true} is VALID [2021-09-13 14:38:51,281 INFO L281 TraceCheckUtils]: 1: Hoare triple {2273#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2281#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} is VALID [2021-09-13 14:38:51,281 INFO L281 TraceCheckUtils]: 2: Hoare triple {2281#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} assume !(0 == assume_abort_if_not_~cond); {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:51,282 INFO L281 TraceCheckUtils]: 3: Hoare triple {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:51,282 INFO L281 TraceCheckUtils]: 4: Hoare triple {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:51,283 INFO L281 TraceCheckUtils]: 5: Hoare triple {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:51,283 INFO L281 TraceCheckUtils]: 6: Hoare triple {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:51,283 INFO L281 TraceCheckUtils]: 7: Hoare triple {2285#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {2301#(<= 0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:51,287 INFO L281 TraceCheckUtils]: 8: Hoare triple {2301#(<= 0 ULTIMATE.start_main_~a~0)} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2301#(<= 0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:51,287 INFO L281 TraceCheckUtils]: 9: Hoare triple {2301#(<= 0 ULTIMATE.start_main_~a~0)} assume !(0 == __VERIFIER_assert_~cond); {2301#(<= 0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:38:51,287 INFO L281 TraceCheckUtils]: 10: Hoare triple {2301#(<= 0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~a~0 && 0 != main_~b~0); {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,288 INFO L281 TraceCheckUtils]: 11: Hoare triple {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,288 INFO L281 TraceCheckUtils]: 12: Hoare triple {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,289 INFO L281 TraceCheckUtils]: 13: Hoare triple {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume 0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 1 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2);main_~b~0 := main_~b~0 - 1;main_~q~0 := main_~q~0 + main_~a~0 * main_~p~0; {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,289 INFO L281 TraceCheckUtils]: 14: Hoare triple {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,290 INFO L281 TraceCheckUtils]: 15: Hoare triple {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,290 INFO L281 TraceCheckUtils]: 16: Hoare triple {2311#(and (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 != main_~a~0 && 0 != main_~b~0); {2330#(and (= ULTIMATE.start_main_~b~0 0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,290 INFO L281 TraceCheckUtils]: 17: Hoare triple {2330#(and (= ULTIMATE.start_main_~b~0 0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2330#(and (= ULTIMATE.start_main_~b~0 0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,291 INFO L281 TraceCheckUtils]: 18: Hoare triple {2330#(and (= ULTIMATE.start_main_~b~0 0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2330#(and (= ULTIMATE.start_main_~b~0 0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:51,291 INFO L281 TraceCheckUtils]: 19: Hoare triple {2330#(and (= ULTIMATE.start_main_~b~0 0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 * main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2340#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:38:51,292 INFO L281 TraceCheckUtils]: 20: Hoare triple {2340#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2274#false} is VALID [2021-09-13 14:38:51,292 INFO L281 TraceCheckUtils]: 21: Hoare triple {2274#false} assume !false; {2274#false} is VALID [2021-09-13 14:38:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:38:51,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:38:51,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:38:51,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547306145] [2021-09-13 14:38:51,292 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:38:51,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767891721] [2021-09-13 14:38:51,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767891721] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:38:51,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:38:51,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:38:51,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611994833] [2021-09-13 14:38:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) Word has length 22 [2021-09-13 14:38:51,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:38:51,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2021-09-13 14:38:51,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:51,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:38:51,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:38:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:38:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:38:51,315 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2021-09-13 14:38:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:51,644 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-09-13 14:38:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:38:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) Word has length 22 [2021-09-13 14:38:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:38:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2021-09-13 14:38:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2021-09-13 14:38:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2021-09-13 14:38:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2021-09-13 14:38:51,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2021-09-13 14:38:51,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:51,674 INFO L225 Difference]: With dead ends: 40 [2021-09-13 14:38:51,674 INFO L226 Difference]: Without dead ends: 34 [2021-09-13 14:38:51,674 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 89.95ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:38:51,674 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.56ms IncrementalHoareTripleChecker+Time [2021-09-13 14:38:51,675 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 91.56ms Time] [2021-09-13 14:38:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-09-13 14:38:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2021-09-13 14:38:51,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:38:51,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:51,743 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:51,743 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:51,744 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-09-13 14:38:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-09-13 14:38:51,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:51,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:51,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 34 states. [2021-09-13 14:38:51,744 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 34 states. [2021-09-13 14:38:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:51,745 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-09-13 14:38:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-09-13 14:38:51,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:51,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:51,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:38:51,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:38:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-09-13 14:38:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-09-13 14:38:51,747 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2021-09-13 14:38:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:38:51,747 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-09-13 14:38:51,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2021-09-13 14:38:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-09-13 14:38:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:38:51,748 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:38:51,748 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:38:51,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:38:51,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-09-13 14:38:51,957 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:38:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:38:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1476469470, now seen corresponding path program 1 times [2021-09-13 14:38:51,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:38:51,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363092391] [2021-09-13 14:38:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:51,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:38:51,973 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:38:51,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393331438] [2021-09-13 14:38:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:38:51,982 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:38:51,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:38:51,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:38:51,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-09-13 14:38:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:52,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:38:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:38:52,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:38:52,670 INFO L281 TraceCheckUtils]: 0: Hoare triple {2511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2511#true} is VALID [2021-09-13 14:38:52,671 INFO L281 TraceCheckUtils]: 1: Hoare triple {2511#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2519#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} is VALID [2021-09-13 14:38:52,672 INFO L281 TraceCheckUtils]: 2: Hoare triple {2519#(or (and (or (< ULTIMATE.start_main_~x~0 0) (< 100 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)))} assume !(0 == assume_abort_if_not_~cond); {2523#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:52,672 INFO L281 TraceCheckUtils]: 3: Hoare triple {2523#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2523#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:52,673 INFO L281 TraceCheckUtils]: 4: Hoare triple {2523#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {2523#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:52,673 INFO L281 TraceCheckUtils]: 5: Hoare triple {2523#(and (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2533#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:52,674 INFO L281 TraceCheckUtils]: 6: Hoare triple {2533#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} assume !(0 == assume_abort_if_not_~cond); {2537#(and (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} is VALID [2021-09-13 14:38:52,674 INFO L281 TraceCheckUtils]: 7: Hoare triple {2537#(and (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {2541#(and (<= 1 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:52,674 INFO L281 TraceCheckUtils]: 8: Hoare triple {2541#(and (<= 1 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~a~0))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2541#(and (<= 1 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:52,675 INFO L281 TraceCheckUtils]: 9: Hoare triple {2541#(and (<= 1 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2541#(and (<= 1 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:52,675 INFO L281 TraceCheckUtils]: 10: Hoare triple {2541#(and (<= 1 ULTIMATE.start_main_~b~0) (<= 0 ULTIMATE.start_main_~a~0))} assume !!(0 != main_~a~0 && 0 != main_~b~0); {2551#(and (<= 1 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:52,676 INFO L281 TraceCheckUtils]: 11: Hoare triple {2551#(and (<= 1 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2551#(and (<= 1 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:52,676 INFO L281 TraceCheckUtils]: 12: Hoare triple {2551#(and (<= 1 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2551#(and (<= 1 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:38:52,677 INFO L281 TraceCheckUtils]: 13: Hoare triple {2551#(and (<= 1 ULTIMATE.start_main_~b~0) (not (= ULTIMATE.start_main_~a~0 0)) (<= 0 ULTIMATE.start_main_~a~0))} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 1 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2));main_~a~0 := main_~a~0 - 1;main_~b~0 := main_~b~0 - 1;main_~q~0 := main_~q~0 + (1 + (main_~a~0 + main_~b~0)) * main_~p~0; {2561#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)))} is VALID [2021-09-13 14:38:52,678 INFO L281 TraceCheckUtils]: 14: Hoare triple {2561#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)))} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2561#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)))} is VALID [2021-09-13 14:38:52,678 INFO L281 TraceCheckUtils]: 15: Hoare triple {2561#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)))} assume !(0 == __VERIFIER_assert_~cond); {2561#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)))} is VALID [2021-09-13 14:38:52,678 INFO L281 TraceCheckUtils]: 16: Hoare triple {2561#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)))} assume !(0 != main_~a~0 && 0 != main_~b~0); {2571#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (or (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:38:52,679 INFO L281 TraceCheckUtils]: 17: Hoare triple {2571#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (or (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~b~0 0)))} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2571#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (or (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:38:52,679 INFO L281 TraceCheckUtils]: 18: Hoare triple {2571#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (or (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {2571#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (or (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:38:52,681 INFO L281 TraceCheckUtils]: 19: Hoare triple {2571#(and (<= 0 ULTIMATE.start_main_~b~0) (< 0 (+ ULTIMATE.start_main_~a~0 1)) (or (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~b~0 0)))} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 * main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2581#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:38:52,681 INFO L281 TraceCheckUtils]: 20: Hoare triple {2581#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2512#false} is VALID [2021-09-13 14:38:52,681 INFO L281 TraceCheckUtils]: 21: Hoare triple {2512#false} assume !false; {2512#false} is VALID [2021-09-13 14:38:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:38:52,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:38:52,798 INFO L281 TraceCheckUtils]: 21: Hoare triple {2512#false} assume !false; {2512#false} is VALID [2021-09-13 14:38:52,798 INFO L281 TraceCheckUtils]: 20: Hoare triple {2581#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2512#false} is VALID [2021-09-13 14:38:52,804 INFO L281 TraceCheckUtils]: 19: Hoare triple {2594#(= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0)} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 * main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2581#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:38:52,804 INFO L281 TraceCheckUtils]: 18: Hoare triple {2594#(= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0)} assume !(0 == __VERIFIER_assert_~cond); {2594#(= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0)} is VALID [2021-09-13 14:38:52,805 INFO L281 TraceCheckUtils]: 17: Hoare triple {2594#(= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0)} __VERIFIER_assert_#in~cond := (if main_~q~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2594#(= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0)} is VALID [2021-09-13 14:38:52,807 INFO L281 TraceCheckUtils]: 16: Hoare triple {2511#true} assume !(0 != main_~a~0 && 0 != main_~b~0); {2594#(= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0)} is VALID [2021-09-13 14:38:52,807 INFO L281 TraceCheckUtils]: 15: Hoare triple {2511#true} assume !(0 == __VERIFIER_assert_~cond); {2511#true} is VALID [2021-09-13 14:38:52,807 INFO L281 TraceCheckUtils]: 14: Hoare triple {2511#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2511#true} is VALID [2021-09-13 14:38:52,807 INFO L281 TraceCheckUtils]: 13: Hoare triple {2511#true} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 1 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2));main_~a~0 := main_~a~0 - 1;main_~b~0 := main_~b~0 - 1;main_~q~0 := main_~q~0 + (1 + (main_~a~0 + main_~b~0)) * main_~p~0; {2511#true} is VALID [2021-09-13 14:38:52,807 INFO L281 TraceCheckUtils]: 12: Hoare triple {2511#true} assume !(1 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2511#true} is VALID [2021-09-13 14:38:52,808 INFO L281 TraceCheckUtils]: 11: Hoare triple {2511#true} assume !(0 == (if main_~a~0 < 0 && 0 != main_~a~0 % 2 then main_~a~0 % 2 - 2 else main_~a~0 % 2) && 0 == (if main_~b~0 < 0 && 0 != main_~b~0 % 2 then main_~b~0 % 2 - 2 else main_~b~0 % 2)); {2511#true} is VALID [2021-09-13 14:38:52,808 INFO L281 TraceCheckUtils]: 10: Hoare triple {2511#true} assume !!(0 != main_~a~0 && 0 != main_~b~0); {2511#true} is VALID [2021-09-13 14:38:52,808 INFO L281 TraceCheckUtils]: 9: Hoare triple {2511#true} assume !(0 == __VERIFIER_assert_~cond); {2511#true} is VALID [2021-09-13 14:38:52,808 INFO L281 TraceCheckUtils]: 8: Hoare triple {2511#true} assume !false;__VERIFIER_assert_#in~cond := (if main_~q~0 + main_~a~0 * main_~b~0 * main_~p~0 == main_~x~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2511#true} is VALID [2021-09-13 14:38:52,808 INFO L281 TraceCheckUtils]: 7: Hoare triple {2511#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0; {2511#true} is VALID [2021-09-13 14:38:52,808 INFO L281 TraceCheckUtils]: 6: Hoare triple {2511#true} assume !(0 == assume_abort_if_not_~cond); {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L281 TraceCheckUtils]: 5: Hoare triple {2511#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L281 TraceCheckUtils]: 4: Hoare triple {2511#true} assume !(0 == assume_abort_if_not_~cond); {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L281 TraceCheckUtils]: 3: Hoare triple {2511#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~y~0 >= 0 && main_~y~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L281 TraceCheckUtils]: 2: Hoare triple {2511#true} assume !(0 == assume_abort_if_not_~cond); {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L281 TraceCheckUtils]: 1: Hoare triple {2511#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~x~0 >= 0 && main_~x~0 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L281 TraceCheckUtils]: 0: Hoare triple {2511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2511#true} is VALID [2021-09-13 14:38:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:38:52,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:38:52,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363092391] [2021-09-13 14:38:52,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:38:52,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393331438] [2021-09-13 14:38:52,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393331438] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:38:52,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:38:52,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2021-09-13 14:38:52,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898056295] [2021-09-13 14:38:52,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 22 [2021-09-13 14:38:52,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:38:52,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:38:52,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:52,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:38:52,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:38:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:38:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:38:52,825 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:38:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:53,188 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2021-09-13 14:38:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:38:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 22 [2021-09-13 14:38:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:38:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:38:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-09-13 14:38:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:38:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-09-13 14:38:53,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2021-09-13 14:38:53,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:38:53,230 INFO L225 Difference]: With dead ends: 28 [2021-09-13 14:38:53,230 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:38:53,230 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 110.53ms TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:38:53,230 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.15ms IncrementalHoareTripleChecker+Time [2021-09-13 14:38:53,231 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.24ms Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 126.15ms Time] [2021-09-13 14:38:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:38:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:38:53,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:38:53,231 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) [2021-09-13 14:38:53,231 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) [2021-09-13 14:38:53,231 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) [2021-09-13 14:38:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:53,232 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:38:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:38:53,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:53,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:53,232 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. [2021-09-13 14:38:53,232 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. [2021-09-13 14:38:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:38:53,232 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:38:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:38:53,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:53,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:38:53,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:38:53,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:38:53,233 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) [2021-09-13 14:38:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:38:53,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-09-13 14:38:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:38:53,233 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:38:53,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:38:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:38:53,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:38:53,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-09-13 14:38:53,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-09-13 14:38:53,236 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-09-13 14:38:53,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-09-13 14:38:53,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-09-13 14:38:53,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:38:53,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:38:53,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:38:53,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:38:53,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:38:53,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:39:23,947 WARN L210 SmtUtils]: Spent 30.30s on a formula simplification. DAG size of input: 87 DAG size of output: 27 [2021-09-13 14:39:27,003 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2021-09-13 14:39:27,003 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2021-09-13 14:39:27,003 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2021-09-13 14:39:27,003 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:39:27,003 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:39:27,003 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L854 garLoopResultBuilder]: At program point L12-2(lines 37 38) the Hoare annotation is: (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~b~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) (<= ULTIMATE.start_main_~b~0 100) (<= 0 ULTIMATE.start_main_~a~0) (<= 0 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 100)) [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L12-3(lines 12 15) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L8-1(lines 8 10) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L854 garLoopResultBuilder]: At program point L12-5(lines 11 17) the Hoare annotation is: (let ((.cse7 (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)) (.cse4 (<= 0 ULTIMATE.start_main_~a~0))) (let ((.cse0 (or (= (let ((.cse8 (div ULTIMATE.start_main_~b~0 2))) (+ ULTIMATE.start_main_~q~0 (* 4 (* (div ULTIMATE.start_main_~a~0 2) ULTIMATE.start_main_~p~0 .cse8)) (* 4 (* ULTIMATE.start_main_~p~0 .cse8)))) .cse7) (not (= (mod ULTIMATE.start_main_~b~0 2) 0)) (= 0 (mod ULTIMATE.start_main_~a~0 2)) .cse4)) (.cse1 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse2 (= .cse7 (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0)))) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (<= 0 ULTIMATE.start_main_~x~0)) (.cse6 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~b~0) .cse2 .cse3 (<= ULTIMATE.start_main_~y~0 100) (= (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~b~0) 0) .cse4 .cse5 .cse6) (and .cse0 (= ULTIMATE.start_main_~a~0 0) .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_main_~b~0) .cse5 .cse6)))) [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L8-2(lines 8 10) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L12-6(lines 12 15) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L861 garLoopResultBuilder]: At program point L12-8(lines 11 17) the Hoare annotation is: true [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:39:27,004 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L13-1(lines 13 14) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 13 14) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L9-2(line 9) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L9-4(line 9) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L34-2(lines 34 55) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L861 garLoopResultBuilder]: At program point L59(lines 19 60) the Hoare annotation is: true [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2021-09-13 14:39:27,005 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse1 (<= ULTIMATE.start_main_~b~0 100)) (.cse2 (<= 0 ULTIMATE.start_main_~x~0)) (.cse3 (<= ULTIMATE.start_main_~x~0 100))) (or (and .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~b~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (+ ULTIMATE.start_main_~q~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~b~0))) (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 100) .cse1 (<= 0 ULTIMATE.start_main_~a~0) .cse2 .cse3) (and .cse0 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~q~0 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2021-09-13 14:39:27,008 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2021-09-13 14:39:27,011 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:39:27,012 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L12-6 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L12-6 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L12-6 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2021-09-13 14:39:27,013 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2021-09-13 14:39:27,014 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2021-09-13 14:39:27,014 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2021-09-13 14:39:27,014 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 14:39:27,014 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 14:39:27,014 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:39:27,014 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:39:27,014 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:39:27,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:39:27 BoogieIcfgContainer [2021-09-13 14:39:27,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:39:27,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:39:27,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:39:27,040 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:39:27,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:34:24" (3/4) ... [2021-09-13 14:39:27,042 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:39:27,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-09-13 14:39:27,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:39:27,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:39:27,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:39:27,085 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:39:27,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:39:27,086 INFO L158 Benchmark]: Toolchain (without parser) took 302966.10ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.4MB in the beginning and 22.9MB in the end (delta: 12.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2021-09-13 14:39:27,086 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.6MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:39:27,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 39.4MB in the end (delta: -4.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:39:27,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.92ms. Allocated memory is still 56.6MB. Free memory was 39.4MB in the beginning and 37.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:39:27,087 INFO L158 Benchmark]: Boogie Preprocessor took 30.45ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 36.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:39:27,087 INFO L158 Benchmark]: RCFGBuilder took 383.32ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 36.2MB in the beginning and 52.8MB in the end (delta: -16.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2021-09-13 14:39:27,088 INFO L158 Benchmark]: TraceAbstraction took 302177.26ms. Allocated memory is still 71.3MB. Free memory was 52.5MB in the beginning and 26.4MB in the end (delta: 26.1MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2021-09-13 14:39:27,088 INFO L158 Benchmark]: Witness Printer took 45.71ms. Allocated memory is still 71.3MB. Free memory was 26.4MB in the beginning and 22.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:39:27,089 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.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.6MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 39.4MB in the end (delta: -4.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.92ms. Allocated memory is still 56.6MB. Free memory was 39.4MB in the beginning and 37.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.45ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 36.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.32ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 36.2MB in the beginning and 52.8MB in the end (delta: -16.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 302177.26ms. Allocated memory is still 71.3MB. Free memory was 52.5MB in the beginning and 26.4MB in the end (delta: 26.1MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 45.71ms. Allocated memory is still 71.3MB. Free memory was 26.4MB in the beginning and 22.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 28 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 302105.51ms, OverallIterations: 11, TraceHistogramMax: 2, EmptinessCheckTime: 15.87ms, AutomataDifference: 30013.08ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 33566.25ms, InitialAbstractionConstructionTime: 15.59ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 9630.49ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9607.90ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 552 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 0 mSDtfsCounter, 1216 mSolverCounterSat, 12.83ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 3419.60ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 624.07ms AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 253 HoareAnnotationTreeSize, 5 FomulaSimplifications, 5541 FormulaSimplificationTreeSizeReduction, 210.97ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 5322 FormulaSimplificationTreeSizeReductionInter, 33346.89ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 62.73ms SsaConstructionTime, 149.95ms SatisfiabilityAnalysisTime, 228721.64ms InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 248 ConstructedInterpolants, 4 QuantifiedInterpolants, 2259 SizeOfPredicates, 91 NumberOfNonLiveVariables, 869 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 15/31 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 3 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((((cond == 1 && 1 <= cond) && 0 <= b) && x * y == q + a * p * b) && 1 <= y) && y <= 100) && b <= 100) && 0 <= a) && 0 <= x) && x <= 100 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((cond == 1 && 1 <= cond) && 0 <= b) && x * y == q + a * p * b) && 1 <= y) && y <= 100) && b <= 100) && 0 <= a) && 0 <= x) && x <= 100) || ((((((((cond == 1 && a == x) && p == 1) && 1 <= b) && q == 0) && b <= 100) && 0 <= x) && x <= 100) && b == y) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (((((((((((((q + 4 * (a / 2 * p * (b / 2)) + 4 * (p * (b / 2)) == x * y || !(b % 2 == 0)) || 0 == a % 2) || 0 <= a) && cond == 1) && 1 <= cond) && 0 <= b) && x * y == q + a * p * b) && 1 <= y) && y <= 100) && a * b == 0) && 0 <= a) && 0 <= x) && x <= 100) || ((((((((((q + 4 * (a / 2 * p * (b / 2)) + 4 * (p * (b / 2)) == x * y || !(b % 2 == 0)) || 0 == a % 2) || 0 <= a) && a == 0) && cond == 1) && x * y == q + a * p * b) && 1 <= y) && 1 <= b) && 0 <= x) && x <= 100) RESULT: Ultimate proved your program to be correct! [2021-09-13 14:39:27,162 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...