./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_2_1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 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/combinations/gcd_4+newton_2_1.i -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 4f3a518e2178ada847d08214b3921c5447bcf5e7ad9d30e9f833babec7755c7f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:36:05,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:36:05,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:36:05,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:36:05,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:36:05,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:36:05,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:36:05,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:36:05,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:36:05,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:36:05,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:36:05,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:36:05,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:36:05,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:36:05,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:36:05,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:36:05,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:36:05,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:36:05,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:36:05,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:36:05,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:36:05,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:36:05,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:36:05,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:36:05,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:36:05,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:36:05,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:36:05,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:36:05,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:36:05,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:36:05,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:36:05,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:36:05,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:36:05,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:36:05,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:36:05,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:36:05,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:36:05,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:36:05,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:36:05,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:36:05,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:36:05,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:36:05,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:36:05,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:36:05,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:36:05,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:36:05,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:36:05,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:36:05,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:36:05,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:36:05,381 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:36:05,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:36:05,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:36:05,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:36:05,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:36:05,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:36:05,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:36:05,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:36:05,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:36:05,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:36:05,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:36:05,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:36:05,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:36:05,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:36:05,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:36:05,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:36:05,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:36:05,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:36:05,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:36:05,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:36:05,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:36:05,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:36:05,386 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:36:05,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:36:05,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:36:05,387 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 -> 4f3a518e2178ada847d08214b3921c5447bcf5e7ad9d30e9f833babec7755c7f [2022-02-20 19:36:05,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:36:05,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:36:05,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:36:05,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:36:05,628 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:36:05,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_1.i [2022-02-20 19:36:05,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a88a74/06162c85767f47bcb3c7d83fee3f72f3/FLAG6c1c47f39 [2022-02-20 19:36:06,112 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:36:06,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i [2022-02-20 19:36:06,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a88a74/06162c85767f47bcb3c7d83fee3f72f3/FLAG6c1c47f39 [2022-02-20 19:36:06,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a88a74/06162c85767f47bcb3c7d83fee3f72f3 [2022-02-20 19:36:06,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:36:06,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:36:06,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:36:06,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:36:06,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:36:06,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762957af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06, skipping insertion in model container [2022-02-20 19:36:06,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:36:06,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:36:06,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[1224,1237] [2022-02-20 19:36:06,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[2827,2840] [2022-02-20 19:36:06,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:36:06,379 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:36:06,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[1224,1237] [2022-02-20 19:36:06,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[2827,2840] [2022-02-20 19:36:06,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:36:06,416 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:36:06,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06 WrapperNode [2022-02-20 19:36:06,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:36:06,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:36:06,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:36:06,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:36:06,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,458 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 72 [2022-02-20 19:36:06,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:36:06,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:36:06,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:36:06,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:36:06,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:36:06,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:36:06,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:36:06,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:36:06,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (1/1) ... [2022-02-20 19:36:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:36:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:36:06,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:36:06,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:36:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:36:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:36:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:36:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:36:06,560 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:36:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:36:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:36:06,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:36:06,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 19:36:06,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 19:36:06,631 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:36:06,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:36:06,908 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:36:06,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:36:06,915 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:36:06,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:06 BoogieIcfgContainer [2022-02-20 19:36:06,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:36:06,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:36:06,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:36:06,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:36:06,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:36:06" (1/3) ... [2022-02-20 19:36:06,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3853c916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:36:06, skipping insertion in model container [2022-02-20 19:36:06,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:06" (2/3) ... [2022-02-20 19:36:06,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3853c916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:36:06, skipping insertion in model container [2022-02-20 19:36:06,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:06" (3/3) ... [2022-02-20 19:36:06,935 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_1.i [2022-02-20 19:36:06,946 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:36:06,946 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:36:07,003 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:36:07,019 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:36:07,019 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:36:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 19:36:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:36:07,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:07,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:07,047 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1780479560, now seen corresponding path program 1 times [2022-02-20 19:36:07,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:36:07,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874630091] [2022-02-20 19:36:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:36:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:07,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {46#true} is VALID [2022-02-20 19:36:07,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {46#true} is VALID [2022-02-20 19:36:07,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {48#(and (<= 63 |ULTIMATE.start_main1_~x~0#1|) (= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0))} is VALID [2022-02-20 19:36:07,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {48#(and (<= 63 |ULTIMATE.start_main1_~x~0#1|) (= (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) |ULTIMATE.start_main1_~x~0#1|) 0))} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := -gcd_test_~a#1; {47#false} is VALID [2022-02-20 19:36:07,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#false} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := -gcd_test_~b#1; {47#false} is VALID [2022-02-20 19:36:07,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#false} assume 0 == gcd_test_~a#1;gcd_test_#res#1 := gcd_test_~b#1; {47#false} is VALID [2022-02-20 19:36:07,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {47#false} is VALID [2022-02-20 19:36:07,315 INFO L272 TraceCheckUtils]: 7: Hoare triple {47#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {47#false} is VALID [2022-02-20 19:36:07,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2022-02-20 19:36:07,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2022-02-20 19:36:07,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 19:36:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:07,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:36:07,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874630091] [2022-02-20 19:36:07,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874630091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:36:07,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:36:07,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:36:07,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827939045] [2022-02-20 19:36:07,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:36:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:36:07,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:07,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:07,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:36:07,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:36:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:36:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:36:07,373 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:07,548 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2022-02-20 19:36:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:36:07,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:36:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:36:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 19:36:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 19:36:07,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 19:36:07,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:07,690 INFO L225 Difference]: With dead ends: 93 [2022-02-20 19:36:07,691 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 19:36:07,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:36:07,696 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:36:07,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 92 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:36:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 19:36:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-02-20 19:36:07,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:36:07,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:07,725 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:07,726 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:07,736 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 19:36:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 19:36:07,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:07,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:07,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-02-20 19:36:07,741 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-02-20 19:36:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:07,750 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 19:36:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 19:36:07,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:07,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:07,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:36:07,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:36:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 19:36:07,756 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2022-02-20 19:36:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:36:07,757 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 19:36:07,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 19:36:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:36:07,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:07,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:07,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:36:07,763 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 413626440, now seen corresponding path program 1 times [2022-02-20 19:36:07,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:36:07,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391698946] [2022-02-20 19:36:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:36:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:07,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 19:36:07,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {312#true} is VALID [2022-02-20 19:36:07,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {314#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} is VALID [2022-02-20 19:36:07,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {314#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} assume !(gcd_test_~a#1 < 0); {314#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} is VALID [2022-02-20 19:36:07,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0)} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := -gcd_test_~b#1; {313#false} is VALID [2022-02-20 19:36:07,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#false} assume !(0 == gcd_test_~a#1); {313#false} is VALID [2022-02-20 19:36:07,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#false} assume !(0 != gcd_test_~b#1); {313#false} is VALID [2022-02-20 19:36:07,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#false} gcd_test_#res#1 := gcd_test_~a#1; {313#false} is VALID [2022-02-20 19:36:07,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {313#false} is VALID [2022-02-20 19:36:07,820 INFO L272 TraceCheckUtils]: 9: Hoare triple {313#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {313#false} is VALID [2022-02-20 19:36:07,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#false} ~cond := #in~cond; {313#false} is VALID [2022-02-20 19:36:07,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {313#false} assume 0 == ~cond; {313#false} is VALID [2022-02-20 19:36:07,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 19:36:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:07,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:36:07,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391698946] [2022-02-20 19:36:07,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391698946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:36:07,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:36:07,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:36:07,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652302551] [2022-02-20 19:36:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:36:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 19:36:07,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:07,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:07,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:36:07,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:36:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:36:07,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:36:07,840 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:07,912 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-20 19:36:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:36:07,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 19:36:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:36:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 19:36:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 19:36:07,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 19:36:07,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:07,983 INFO L225 Difference]: With dead ends: 52 [2022-02-20 19:36:07,984 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 19:36:07,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:36:07,990 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:36:07,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:36:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 19:36:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 19:36:08,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:36:08,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,007 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,007 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:08,015 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 19:36:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 19:36:08,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:08,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:08,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-02-20 19:36:08,018 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-02-20 19:36:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:08,022 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 19:36:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 19:36:08,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:08,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:08,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:36:08,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:36:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-02-20 19:36:08,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 13 [2022-02-20 19:36:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:36:08,029 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-02-20 19:36:08,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 19:36:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 19:36:08,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:08,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:08,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:36:08,033 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1715037691, now seen corresponding path program 1 times [2022-02-20 19:36:08,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:36:08,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588213703] [2022-02-20 19:36:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:36:08,058 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:36:08,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352409702] [2022-02-20 19:36:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:08,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:36:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:36:08,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:36:08,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:36:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:08,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 19:36:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:08,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:36:08,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-02-20 19:36:08,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {515#true} is VALID [2022-02-20 19:36:08,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:08,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:08,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:08,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:08,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:08,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {542#(<= (+ |ULTIMATE.start_gcd_test_~b#1| 45) 0)} is VALID [2022-02-20 19:36:08,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(<= (+ |ULTIMATE.start_gcd_test_~b#1| 45) 0)} assume !(0 != gcd_test_~b#1); {516#false} is VALID [2022-02-20 19:36:08,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#false} gcd_test_#res#1 := gcd_test_~a#1; {516#false} is VALID [2022-02-20 19:36:08,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {516#false} is VALID [2022-02-20 19:36:08,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {516#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {516#false} is VALID [2022-02-20 19:36:08,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2022-02-20 19:36:08,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2022-02-20 19:36:08,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-02-20 19:36:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:08,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:36:08,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-02-20 19:36:08,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2022-02-20 19:36:08,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2022-02-20 19:36:08,481 INFO L272 TraceCheckUtils]: 11: Hoare triple {516#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {516#false} is VALID [2022-02-20 19:36:08,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {516#false} is VALID [2022-02-20 19:36:08,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#false} gcd_test_#res#1 := gcd_test_~a#1; {516#false} is VALID [2022-02-20 19:36:08,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} assume !(0 != gcd_test_~b#1); {516#false} is VALID [2022-02-20 19:36:08,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {582#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:36:08,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:08,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(0 == gcd_test_~a#1); {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:08,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~b#1 < 0); {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:08,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 < 0); {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:08,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {586#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:08,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {515#true} is VALID [2022-02-20 19:36:08,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-02-20 19:36:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:08,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:36:08,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588213703] [2022-02-20 19:36:08,492 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:36:08,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352409702] [2022-02-20 19:36:08,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352409702] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:36:08,492 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:36:08,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 19:36:08,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100100752] [2022-02-20 19:36:08,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:36:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 19:36:08,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:08,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:08,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:36:08,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:36:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:36:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:36:08,515 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:08,626 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-20 19:36:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:36:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 19:36:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:36:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 19:36:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 19:36:08,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-02-20 19:36:08,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:08,688 INFO L225 Difference]: With dead ends: 55 [2022-02-20 19:36:08,688 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 19:36:08,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:36:08,689 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:36:08,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:36:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 19:36:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 19:36:08,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:36:08,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,696 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,697 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:08,699 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-02-20 19:36:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-20 19:36:08,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:08,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:08,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 19:36:08,700 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 19:36:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:08,702 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-02-20 19:36:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-20 19:36:08,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:08,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:08,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:36:08,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:36:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-02-20 19:36:08,706 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 15 [2022-02-20 19:36:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:36:08,706 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-02-20 19:36:08,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-20 19:36:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 19:36:08,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:08,707 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:08,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:36:08,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:36:08,924 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1992731711, now seen corresponding path program 1 times [2022-02-20 19:36:08,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:36:08,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125514363] [2022-02-20 19:36:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:36:08,957 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:36:08,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110772648] [2022-02-20 19:36:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:08,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:36:08,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:36:08,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:36:08,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:36:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:09,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 19:36:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:09,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:36:09,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {824#true} is VALID [2022-02-20 19:36:09,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {824#true} is VALID [2022-02-20 19:36:09,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {851#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {851#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {858#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {858#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-20 19:36:09,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {865#(<= (div (+ (- 45) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 2)) 18)} is VALID [2022-02-20 19:36:09,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#(<= (div (+ (- 45) (* |ULTIMATE.start_gcd_test_~b#1| (- 1))) (- 2)) 18)} assume !(0 != gcd_test_~b#1); {825#false} is VALID [2022-02-20 19:36:09,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#false} gcd_test_#res#1 := gcd_test_~a#1; {825#false} is VALID [2022-02-20 19:36:09,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {825#false} is VALID [2022-02-20 19:36:09,493 INFO L272 TraceCheckUtils]: 15: Hoare triple {825#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {825#false} is VALID [2022-02-20 19:36:09,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2022-02-20 19:36:09,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {825#false} assume 0 == ~cond; {825#false} is VALID [2022-02-20 19:36:09,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {825#false} assume !false; {825#false} is VALID [2022-02-20 19:36:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:09,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:36:09,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {825#false} assume !false; {825#false} is VALID [2022-02-20 19:36:09,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {825#false} assume 0 == ~cond; {825#false} is VALID [2022-02-20 19:36:09,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2022-02-20 19:36:09,702 INFO L272 TraceCheckUtils]: 15: Hoare triple {825#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {825#false} is VALID [2022-02-20 19:36:09,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {825#false} is VALID [2022-02-20 19:36:09,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#false} gcd_test_#res#1 := gcd_test_~a#1; {825#false} is VALID [2022-02-20 19:36:09,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} assume !(0 != gcd_test_~b#1); {825#false} is VALID [2022-02-20 19:36:09,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {909#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {905#(not (<= 0 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:36:09,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {909#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {909#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {916#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {909#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {916#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {916#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {916#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !(0 == gcd_test_~a#1); {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~b#1 < 0); {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 < 0); {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {923#(< (* |ULTIMATE.start_gcd_test_~b#1| 3) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:09,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {824#true} is VALID [2022-02-20 19:36:09,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {824#true} is VALID [2022-02-20 19:36:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:09,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:36:09,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125514363] [2022-02-20 19:36:09,715 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:36:09,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110772648] [2022-02-20 19:36:09,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110772648] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:36:09,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:36:09,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 19:36:09,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454473185] [2022-02-20 19:36:09,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:36:09,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 19:36:09,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:09,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:09,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:09,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:36:09,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:36:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:36:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:36:09,742 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:09,992 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 19:36:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:36:09,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 19:36:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:36:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 19:36:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 19:36:09,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-02-20 19:36:10,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:10,050 INFO L225 Difference]: With dead ends: 57 [2022-02-20 19:36:10,050 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 19:36:10,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:36:10,051 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:36:10,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 198 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:36:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 19:36:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 19:36:10,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:36:10,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:10,062 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:10,062 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:10,064 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 19:36:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 19:36:10,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:10,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:10,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-02-20 19:36:10,065 INFO L87 Difference]: Start difference. First operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-02-20 19:36:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:10,066 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 19:36:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 19:36:10,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:10,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:10,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:36:10,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:36:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-20 19:36:10,068 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2022-02-20 19:36:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:36:10,068 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-20 19:36:10,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 19:36:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 19:36:10,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:10,069 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:10,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:36:10,270 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,SelfDestructingSolverStorable3 [2022-02-20 19:36:10,270 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash -626365316, now seen corresponding path program 2 times [2022-02-20 19:36:10,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:36:10,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547016643] [2022-02-20 19:36:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:10,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:36:10,287 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:36:10,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251848420] [2022-02-20 19:36:10,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:36:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:36:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:36:10,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:36:10,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 19:36:10,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:36:10,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:36:10,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 19:36:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:10,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:36:41,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {1175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1175#true} is VALID [2022-02-20 19:36:41,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {1175#true} is VALID [2022-02-20 19:36:41,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:36:41,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~a#1 < 0); {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:36:41,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~b#1 < 0); {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:36:41,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(0 == gcd_test_~a#1); {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:36:41,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !!(0 != gcd_test_~b#1); {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-20 19:36:41,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1186#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1202#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:36:41,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1202#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {1202#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:36:41,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1209#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-20 19:36:41,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume !!(0 != gcd_test_~b#1); {1209#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-20 19:36:41,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1209#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1216#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:36:41,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {1216#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-20 19:36:41,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1223#(<= 18 (div (+ |ULTIMATE.start_gcd_test_~b#1| 45) 3))} is VALID [2022-02-20 19:36:41,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(<= 18 (div (+ |ULTIMATE.start_gcd_test_~b#1| 45) 3))} assume !(0 != gcd_test_~b#1); {1176#false} is VALID [2022-02-20 19:36:41,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {1176#false} gcd_test_#res#1 := gcd_test_~a#1; {1176#false} is VALID [2022-02-20 19:36:41,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {1176#false} is VALID [2022-02-20 19:36:41,524 INFO L272 TraceCheckUtils]: 17: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {1176#false} is VALID [2022-02-20 19:36:41,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-02-20 19:36:41,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-02-20 19:36:41,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-02-20 19:36:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:41,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:36:41,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-02-20 19:36:41,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-02-20 19:36:41,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-02-20 19:36:41,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~g~0#1 then (if main1_~g~0#1 < 0 then main1_~x~0#1 % main1_~g~0#1 + main1_~g~0#1 else main1_~x~0#1 % main1_~g~0#1 - main1_~g~0#1) else main1_~x~0#1 % main1_~g~0#1) then 1 else 0)); {1176#false} is VALID [2022-02-20 19:36:41,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -2147483648 <= main1_#t~ret5#1 && main1_#t~ret5#1 <= 2147483647;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {1176#false} is VALID [2022-02-20 19:36:41,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {1176#false} gcd_test_#res#1 := gcd_test_~a#1; {1176#false} is VALID [2022-02-20 19:36:41,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {1263#(not (<= |ULTIMATE.start_gcd_test_~b#1| 0))} assume !(0 != gcd_test_~b#1); {1176#false} is VALID [2022-02-20 19:36:41,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {1267#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1263#(not (<= |ULTIMATE.start_gcd_test_~b#1| 0))} is VALID [2022-02-20 19:36:41,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {1267#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !!(0 != gcd_test_~b#1); {1267#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:36:41,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1267#(< |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:36:41,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} assume !!(0 != gcd_test_~b#1); {1274#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} is VALID [2022-02-20 19:36:41,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {1281#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1274#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))} is VALID [2022-02-20 19:36:41,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {1281#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} assume !!(0 != gcd_test_~b#1); {1281#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} is VALID [2022-02-20 19:36:41,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1281#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))} is VALID [2022-02-20 19:36:41,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !!(0 != gcd_test_~b#1); {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:36:41,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !(0 == gcd_test_~a#1); {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:36:41,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !(gcd_test_~b#1 < 0); {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:36:41,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} assume !(gcd_test_~a#1 < 0); {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:36:41,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume 0 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63;main1_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1288#(< |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 4))} is VALID [2022-02-20 19:36:41,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {1175#true} is VALID [2022-02-20 19:36:41,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {1175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1175#true} is VALID [2022-02-20 19:36:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:41,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:36:41,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547016643] [2022-02-20 19:36:41,756 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:36:41,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251848420] [2022-02-20 19:36:41,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251848420] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:36:41,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:36:41,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-20 19:36:41,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543369397] [2022-02-20 19:36:41,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:36:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 19:36:41,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:41,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:41,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:41,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 19:36:41,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:36:41,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 19:36:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:36:41,787 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:42,170 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-02-20 19:36:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:36:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 19:36:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:36:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-02-20 19:36:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2022-02-20 19:36:42,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 78 transitions. [2022-02-20 19:36:42,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:42,242 INFO L225 Difference]: With dead ends: 65 [2022-02-20 19:36:42,242 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 19:36:42,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:36:42,243 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:36:42,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 261 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:36:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 19:36:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 19:36:42,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:36:42,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:42,262 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:42,263 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:42,265 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 19:36:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 19:36:42,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:42,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:42,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 50 states. [2022-02-20 19:36:42,266 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 50 states. [2022-02-20 19:36:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:42,268 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 19:36:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 19:36:42,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:42,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:42,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:36:42,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:36:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:36:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-02-20 19:36:42,270 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 21 [2022-02-20 19:36:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:36:42,271 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-02-20 19:36:42,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 19:36:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 19:36:42,272 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:42,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:42,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:36:42,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:36:42,488 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2101905688, now seen corresponding path program 1 times [2022-02-20 19:36:42,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:36:42,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53810056] [2022-02-20 19:36:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:36:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:36:42,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:36:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:36:42,527 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:36:42,527 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:36:42,528 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:36:42,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:36:42,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:36:42,532 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-02-20 19:36:42,536 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:36:42,546 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret7 := f(~IN~0); [2022-02-20 19:36:42,549 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:36:42,555 INFO L158 Benchmark]: Toolchain (without parser) took 36414.55ms. Allocated memory was 83.9MB in the beginning and 130.0MB in the end (delta: 46.1MB). Free memory was 52.8MB in the beginning and 85.8MB in the end (delta: -33.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-02-20 19:36:42,556 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 53.6MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:36:42,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.81ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 52.5MB in the beginning and 81.7MB in the end (delta: -29.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 19:36:42,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.52ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:36:42,558 INFO L158 Benchmark]: Boogie Preprocessor took 24.19ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 78.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:36:42,558 INFO L158 Benchmark]: RCFGBuilder took 430.45ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 65.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:36:42,559 INFO L158 Benchmark]: TraceAbstraction took 35636.44ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 64.5MB in the beginning and 85.8MB in the end (delta: -21.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-02-20 19:36:42,561 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.19ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 53.6MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.81ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 52.5MB in the beginning and 81.7MB in the end (delta: -29.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.52ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.19ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 78.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.45ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 65.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35636.44ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 64.5MB in the beginning and 85.8MB in the end (delta: -21.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:36:42,584 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/combinations/gcd_4+newton_2_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 4f3a518e2178ada847d08214b3921c5447bcf5e7ad9d30e9f833babec7755c7f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:36:44,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:36:44,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:36:44,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:36:44,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:36:44,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:36:44,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:36:44,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:36:44,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:36:44,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:36:44,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:36:44,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:36:44,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:36:44,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:36:44,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:36:44,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:36:44,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:36:44,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:36:44,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:36:44,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:36:44,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:36:44,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:36:44,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:36:44,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:36:44,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:36:44,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:36:44,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:36:44,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:36:44,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:36:44,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:36:44,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:36:44,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:36:44,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:36:44,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:36:44,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:36:44,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:36:44,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:36:44,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:36:44,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:36:44,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:36:44,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:36:44,537 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:36:44,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:36:44,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:36:44,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:36:44,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:36:44,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:36:44,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:36:44,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:36:44,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:36:44,584 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:36:44,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:36:44,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:36:44,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:36:44,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:36:44,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:36:44,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:36:44,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:36:44,586 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:36:44,586 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:36:44,587 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:36:44,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:36:44,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:36:44,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:36:44,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:36:44,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:36:44,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:36:44,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:36:44,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:36:44,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:36:44,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:36:44,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:36:44,589 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:36:44,590 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:36:44,590 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:36:44,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:36:44,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:36:44,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:36:44,591 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 4f3a518e2178ada847d08214b3921c5447bcf5e7ad9d30e9f833babec7755c7f [2022-02-20 19:36:44,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:36:44,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:36:44,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:36:44,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:36:44,934 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:36:44,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_1.i [2022-02-20 19:36:44,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5742b6b75/7ff51e19afe54e60907d7e3d90908b7d/FLAGc312d6bb5 [2022-02-20 19:36:45,351 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:36:45,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i [2022-02-20 19:36:45,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5742b6b75/7ff51e19afe54e60907d7e3d90908b7d/FLAGc312d6bb5 [2022-02-20 19:36:45,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5742b6b75/7ff51e19afe54e60907d7e3d90908b7d [2022-02-20 19:36:45,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:36:45,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:36:45,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:36:45,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:36:45,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:36:45,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:36:45" (1/1) ... [2022-02-20 19:36:45,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7e98ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:45, skipping insertion in model container [2022-02-20 19:36:45,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:36:45" (1/1) ... [2022-02-20 19:36:45,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:36:45,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:36:45,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[1224,1237] [2022-02-20 19:36:45,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[2827,2840] [2022-02-20 19:36:45,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:36:45,980 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:36:45,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[1224,1237] [2022-02-20 19:36:46,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_1.i[2827,2840] [2022-02-20 19:36:46,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:36:46,015 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:36:46,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46 WrapperNode [2022-02-20 19:36:46,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:36:46,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:36:46,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:36:46,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:36:46,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,051 INFO L137 Inliner]: procedures = 28, calls = 18, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2022-02-20 19:36:46,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:36:46,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:36:46,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:36:46,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:36:46,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:36:46,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:36:46,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:36:46,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:36:46,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (1/1) ... [2022-02-20 19:36:46,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:36:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:36:46,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:36:46,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:36:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:36:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:36:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:36:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:36:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:36:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:36:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:36:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:36:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 19:36:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 19:36:46,213 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:36:46,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:36:53,641 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:36:53,648 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:36:53,648 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:36:53,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:53 BoogieIcfgContainer [2022-02-20 19:36:53,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:36:53,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:36:53,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:36:53,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:36:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:36:45" (1/3) ... [2022-02-20 19:36:53,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9ac246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:36:53, skipping insertion in model container [2022-02-20 19:36:53,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:36:46" (2/3) ... [2022-02-20 19:36:53,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9ac246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:36:53, skipping insertion in model container [2022-02-20 19:36:53,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:53" (3/3) ... [2022-02-20 19:36:53,657 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_1.i [2022-02-20 19:36:53,661 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:36:53,661 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:36:53,702 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:36:53,708 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:36:53,708 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:36:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 19:36:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:36:53,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:53,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:53,730 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1780479560, now seen corresponding path program 1 times [2022-02-20 19:36:53,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:36:53,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536888611] [2022-02-20 19:36:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:36:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:36:53,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:36:53,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:36:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:53,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 19:36:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:53,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:36:54,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {46#true} is VALID [2022-02-20 19:36:54,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1; {46#true} is VALID [2022-02-20 19:36:54,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0bv32 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63bv32;main1_~y~0#1 := 18bv32;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {57#(= (_ bv63 32) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-20 19:36:54,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {57#(= (_ bv63 32) |ULTIMATE.start_gcd_test_~a#1|)} assume ~bvslt32(gcd_test_~a#1, 0bv32);gcd_test_~a#1 := ~bvneg32(gcd_test_~a#1); {47#false} is VALID [2022-02-20 19:36:54,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#false} assume ~bvslt32(gcd_test_~b#1, 0bv32);gcd_test_~b#1 := ~bvneg32(gcd_test_~b#1); {47#false} is VALID [2022-02-20 19:36:54,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#false} assume 0bv32 == gcd_test_~a#1;gcd_test_#res#1 := gcd_test_~b#1; {47#false} is VALID [2022-02-20 19:36:54,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {47#false} is VALID [2022-02-20 19:36:54,088 INFO L272 TraceCheckUtils]: 7: Hoare triple {47#false} call __VERIFIER_assert((if 0bv32 == ~bvsrem32(main1_~x~0#1, main1_~g~0#1) then 1bv32 else 0bv32)); {47#false} is VALID [2022-02-20 19:36:54,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2022-02-20 19:36:54,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#false} assume 0bv32 == ~cond; {47#false} is VALID [2022-02-20 19:36:54,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 19:36:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:54,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:36:54,091 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:36:54,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536888611] [2022-02-20 19:36:54,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536888611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:36:54,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:36:54,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:36:54,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326192584] [2022-02-20 19:36:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:36:54,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:36:54,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:54,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:54,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:54,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:36:54,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:36:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:36:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:36:54,171 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:11,197 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2022-02-20 19:37:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:37:11,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:37:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:37:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 19:37:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 19:37:11,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 19:37:15,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:15,995 INFO L225 Difference]: With dead ends: 93 [2022-02-20 19:37:15,999 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 19:37:16,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:37:16,004 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:37:16,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 92 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:37:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 19:37:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-02-20 19:37:16,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:37:16,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:37:16,034 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:37:16,034 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:37:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:16,044 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 19:37:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 19:37:16,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:16,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:16,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-02-20 19:37:16,047 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-02-20 19:37:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:37:16,051 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-20 19:37:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 19:37:16,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:37:16,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:37:16,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:37:16,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:37:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 19:37:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 19:37:16,057 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2022-02-20 19:37:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:37:16,058 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 19:37:16,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 19:37:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:37:16,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:37:16,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:37:16,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:37:16,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:37:16,273 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:37:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:37:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash 413626440, now seen corresponding path program 1 times [2022-02-20 19:37:16,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:37:16,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919411122] [2022-02-20 19:37:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:37:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:37:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:37:16,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:37:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:37:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:16,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 19:37:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:37:16,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:37:16,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {342#true} is VALID [2022-02-20 19:37:16,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~ret12#1, main_#t~ret13#1; {342#true} is VALID [2022-02-20 19:37:16,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {342#true} assume 0bv32 != main_#t~nondet11#1;havoc main_#t~nondet11#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~ret5#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;havoc main1_~x~0#1;havoc main1_~y~0#1;havoc main1_~g~0#1;main1_~x~0#1 := 63bv32;main1_~y~0#1 := 18bv32;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {353#(= (_ bv18 32) |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:37:16,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {353#(= (_ bv18 32) |ULTIMATE.start_gcd_test_~b#1|)} assume !~bvslt32(gcd_test_~a#1, 0bv32); {353#(= (_ bv18 32) |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:37:16,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {353#(= (_ bv18 32) |ULTIMATE.start_gcd_test_~b#1|)} assume ~bvslt32(gcd_test_~b#1, 0bv32);gcd_test_~b#1 := ~bvneg32(gcd_test_~b#1); {343#false} is VALID [2022-02-20 19:37:16,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#false} assume !(0bv32 == gcd_test_~a#1); {343#false} is VALID [2022-02-20 19:37:16,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#false} assume !(0bv32 != gcd_test_~b#1); {343#false} is VALID [2022-02-20 19:37:16,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#false} gcd_test_#res#1 := gcd_test_~a#1; {343#false} is VALID [2022-02-20 19:37:16,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {343#false} main1_#t~ret5#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;main1_~g~0#1 := main1_#t~ret5#1;havoc main1_#t~ret5#1; {343#false} is VALID [2022-02-20 19:37:16,526 INFO L272 TraceCheckUtils]: 9: Hoare triple {343#false} call __VERIFIER_assert((if 0bv32 == ~bvsrem32(main1_~x~0#1, main1_~g~0#1) then 1bv32 else 0bv32)); {343#false} is VALID [2022-02-20 19:37:16,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#false} ~cond := #in~cond; {343#false} is VALID [2022-02-20 19:37:16,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#false} assume 0bv32 == ~cond; {343#false} is VALID [2022-02-20 19:37:16,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-02-20 19:37:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:37:16,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:37:16,527 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:37:16,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919411122] [2022-02-20 19:37:16,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919411122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:37:16,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:37:16,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:37:16,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342310365] [2022-02-20 19:37:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:37:16,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 19:37:16,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:37:16,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:37:16,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:37:16,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:37:16,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:37:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:37:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:37:16,563 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)