./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 94517564427e872c49cfdf1d666acd8c5b1d1d7f855fe0e11d067a0d3a0e2e28 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:27:29,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:27:29,769 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:27:29,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:27:29,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:27:29,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:27:29,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:27:29,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:27:29,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:27:29,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:27:29,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:27:29,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:27:29,828 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:27:29,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:27:29,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:27:29,830 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:27:29,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:27:29,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:27:29,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:27:29,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:27:29,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:27:29,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:27:29,834 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:27:29,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:27:29,836 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:27:29,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:27:29,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:27:29,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:27:29,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:27:29,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:27:29,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:27:29,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:27:29,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:27:29,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:27:29,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:27:29,841 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:27:29,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:27:29,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:27:29,842 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:27:29,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 94517564427e872c49cfdf1d666acd8c5b1d1d7f855fe0e11d067a0d3a0e2e28 [2023-11-12 02:27:30,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:27:30,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:27:30,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:27:30,214 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:27:30,215 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:27:30,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i [2023-11-12 02:27:33,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:27:33,639 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:27:33,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i [2023-11-12 02:27:33,649 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/data/c1da79f1c/5d8105936e884c6189e183cb9336806c/FLAG6e1bb8698 [2023-11-12 02:27:33,665 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/data/c1da79f1c/5d8105936e884c6189e183cb9336806c [2023-11-12 02:27:33,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:27:33,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:27:33,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:27:33,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:27:33,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:27:33,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:27:33" (1/1) ... [2023-11-12 02:27:33,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3960508f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:33, skipping insertion in model container [2023-11-12 02:27:33,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:27:33" (1/1) ... [2023-11-12 02:27:33,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:27:33,900 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i[915,928] [2023-11-12 02:27:33,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:27:33,957 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:27:33,972 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-82.i[915,928] [2023-11-12 02:27:33,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:27:34,014 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:27:34,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34 WrapperNode [2023-11-12 02:27:34,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:27:34,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:27:34,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:27:34,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:27:34,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,075 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-11-12 02:27:34,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:27:34,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:27:34,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:27:34,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:27:34,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:27:34,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:27:34,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:27:34,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:27:34,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (1/1) ... [2023-11-12 02:27:34,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:27:34,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:27:34,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:27:34,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:27:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:27:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:27:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:27:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:27:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:27:34,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:27:34,321 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:27:34,325 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:27:34,677 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:27:34,691 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:27:34,692 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:27:34,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:27:34 BoogieIcfgContainer [2023-11-12 02:27:34,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:27:34,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:27:34,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:27:34,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:27:34,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:27:33" (1/3) ... [2023-11-12 02:27:34,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539432ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:27:34, skipping insertion in model container [2023-11-12 02:27:34,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:27:34" (2/3) ... [2023-11-12 02:27:34,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539432ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:27:34, skipping insertion in model container [2023-11-12 02:27:34,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:27:34" (3/3) ... [2023-11-12 02:27:34,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-82.i [2023-11-12 02:27:34,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:27:34,734 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:27:34,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:27:34,808 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61a0a1f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:27:34,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:27:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:27:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-12 02:27:34,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:34,823 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:34,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:34,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1308413432, now seen corresponding path program 1 times [2023-11-12 02:27:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:34,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418095087] [2023-11-12 02:27:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:27:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:27:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:27:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:27:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:27:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:27:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:27:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418095087] [2023-11-12 02:27:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418095087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:35,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:27:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648305292] [2023-11-12 02:27:35,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:27:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:27:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:27:35,175 INFO L87 Difference]: Start difference. First operand has 44 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:27:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:35,213 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2023-11-12 02:27:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:27:35,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2023-11-12 02:27:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:35,224 INFO L225 Difference]: With dead ends: 83 [2023-11-12 02:27:35,225 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 02:27:35,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:27:35,242 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:35,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:27:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 02:27:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-12 02:27:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:27:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2023-11-12 02:27:35,291 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 50 [2023-11-12 02:27:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:35,292 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2023-11-12 02:27:35,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:27:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2023-11-12 02:27:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-12 02:27:35,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:35,297 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:35,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:27:35,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:35,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1915915252, now seen corresponding path program 1 times [2023-11-12 02:27:35,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557705175] [2023-11-12 02:27:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:35,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:27:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:27:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:27:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:27:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:27:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:27:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:27:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557705175] [2023-11-12 02:27:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557705175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:27:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498960345] [2023-11-12 02:27:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:35,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:27:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:27:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:27:35,772 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:35,875 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2023-11-12 02:27:35,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:27:35,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2023-11-12 02:27:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:35,881 INFO L225 Difference]: With dead ends: 90 [2023-11-12 02:27:35,882 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 02:27:35,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:27:35,889 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:35,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 124 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:27:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 02:27:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2023-11-12 02:27:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:27:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-11-12 02:27:35,901 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 50 [2023-11-12 02:27:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:35,903 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-11-12 02:27:35,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-11-12 02:27:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-12 02:27:35,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:35,906 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:35,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:27:35,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:35,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1264433201, now seen corresponding path program 1 times [2023-11-12 02:27:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652897118] [2023-11-12 02:27:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:27:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:27:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:27:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:27:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:27:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:27:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:27:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652897118] [2023-11-12 02:27:36,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652897118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:27:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497639308] [2023-11-12 02:27:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:36,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:27:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:27:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:27:36,830 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:37,219 INFO L93 Difference]: Finished difference Result 128 states and 171 transitions. [2023-11-12 02:27:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:27:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-12 02:27:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:37,223 INFO L225 Difference]: With dead ends: 128 [2023-11-12 02:27:37,223 INFO L226 Difference]: Without dead ends: 126 [2023-11-12 02:27:37,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:27:37,225 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 87 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:37,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 347 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:27:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-12 02:27:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 80. [2023-11-12 02:27:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 68 states have internal predecessors, (84), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 02:27:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-11-12 02:27:37,245 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 52 [2023-11-12 02:27:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:37,246 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-11-12 02:27:37,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-11-12 02:27:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-12 02:27:37,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:37,249 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:27:37,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:37,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1006267763, now seen corresponding path program 1 times [2023-11-12 02:27:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135768579] [2023-11-12 02:27:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:27:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:27:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:27:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:27:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:27:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:27:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:27:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135768579] [2023-11-12 02:27:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135768579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:37,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:37,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:27:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883537050] [2023-11-12 02:27:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:37,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:27:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:27:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:27:37,550 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:37,753 INFO L93 Difference]: Finished difference Result 204 states and 265 transitions. [2023-11-12 02:27:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:27:37,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-12 02:27:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:37,757 INFO L225 Difference]: With dead ends: 204 [2023-11-12 02:27:37,757 INFO L226 Difference]: Without dead ends: 127 [2023-11-12 02:27:37,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:27:37,759 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:37,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 183 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:27:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-12 02:27:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2023-11-12 02:27:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:27:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2023-11-12 02:27:37,781 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 52 [2023-11-12 02:27:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:37,781 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2023-11-12 02:27:37,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2023-11-12 02:27:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-12 02:27:37,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:37,783 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:37,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:27:37,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:37,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1630824549, now seen corresponding path program 1 times [2023-11-12 02:27:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059904564] [2023-11-12 02:27:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:27:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:27:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:27:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:27:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:27:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:27:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-12 02:27:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059904564] [2023-11-12 02:27:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059904564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:38,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:38,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:27:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730348486] [2023-11-12 02:27:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:38,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:27:38,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:38,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:27:38,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:27:38,337 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:38,445 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2023-11-12 02:27:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:27:38,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2023-11-12 02:27:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:38,449 INFO L225 Difference]: With dead ends: 165 [2023-11-12 02:27:38,449 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 02:27:38,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:27:38,455 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:38,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:27:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 02:27:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2023-11-12 02:27:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:27:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2023-11-12 02:27:38,487 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 53 [2023-11-12 02:27:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:38,488 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2023-11-12 02:27:38,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-12 02:27:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2023-11-12 02:27:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-12 02:27:38,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:27:38,495 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:38,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:27:38,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:27:38,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash 542361715, now seen corresponding path program 1 times [2023-11-12 02:27:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544566657] [2023-11-12 02:27:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:27:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:27:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:27:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:27:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:27:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:27:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:27:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-12 02:27:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:27:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:27:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-12 02:27:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:27:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:27:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544566657] [2023-11-12 02:27:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544566657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:27:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012662750] [2023-11-12 02:27:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:27:38,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:27:38,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:27:38,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:27:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:38,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:27:38,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:27:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-12 02:27:38,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:27:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012662750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:27:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-12 02:27:38,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363097994] [2023-11-12 02:27:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:38,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:27:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:27:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:27:38,889 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:27:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:27:38,911 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2023-11-12 02:27:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:27:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2023-11-12 02:27:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:27:38,913 INFO L225 Difference]: With dead ends: 99 [2023-11-12 02:27:38,913 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:27:38,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:27:38,914 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:27:38,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:27:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:27:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:27:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:27:38,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2023-11-12 02:27:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:27:38,917 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:27:38,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:27:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:27:38,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:27:38,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:27:38,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 02:27:39,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:27:39,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:27:39,247 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:27:39,248 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:27:39,248 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:27:39,248 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 78 90) no Hoare annotation was computed. [2023-11-12 02:27:39,248 INFO L899 garLoopResultBuilder]: For program point L69(lines 59 70) no Hoare annotation was computed. [2023-11-12 02:27:39,249 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-12 02:27:39,249 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:27:39,253 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-12 02:27:39,253 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-12 02:27:39,253 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-12 02:27:39,253 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-12 02:27:39,254 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:27:39,254 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 73) no Hoare annotation was computed. [2023-11-12 02:27:39,254 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 31) no Hoare annotation was computed. [2023-11-12 02:27:39,254 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-12 02:27:39,254 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-12 02:27:39,254 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-11-12 02:27:39,255 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-12 02:27:39,255 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 58) no Hoare annotation was computed. [2023-11-12 02:27:39,255 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:27:39,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:27:39,255 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-11-12 02:27:39,255 INFO L899 garLoopResultBuilder]: For program point L82-2(lines 82 88) no Hoare annotation was computed. [2023-11-12 02:27:39,256 INFO L895 garLoopResultBuilder]: At program point L82-3(lines 82 88) the Hoare annotation is: (or (and (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_5~0 255) (<= 0 ~var_1_5~0) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|))) [2023-11-12 02:27:39,256 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 74 77) no Hoare annotation was computed. [2023-11-12 02:27:39,256 INFO L899 garLoopResultBuilder]: For program point L82-4(lines 82 88) no Hoare annotation was computed. [2023-11-12 02:27:39,256 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-12 02:27:39,257 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-11-12 02:27:39,257 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:27:39,257 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-12 02:27:39,257 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-11-12 02:27:39,257 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-11-12 02:27:39,257 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-11-12 02:27:39,258 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-11-12 02:27:39,258 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-12 02:27:39,258 INFO L899 garLoopResultBuilder]: For program point L34-2(line 34) no Hoare annotation was computed. [2023-11-12 02:27:39,258 INFO L899 garLoopResultBuilder]: For program point L34-4(lines 34 38) no Hoare annotation was computed. [2023-11-12 02:27:39,258 INFO L899 garLoopResultBuilder]: For program point L34-6(lines 32 58) no Hoare annotation was computed. [2023-11-12 02:27:39,258 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-12 02:27:39,259 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) [2023-11-12 02:27:39,259 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:27:39,259 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:27:39,259 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:27:39,259 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:27:39,263 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-12 02:27:39,265 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:27:39,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:27:39 BoogieIcfgContainer [2023-11-12 02:27:39,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:27:39,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:27:39,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:27:39,278 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:27:39,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:27:34" (3/4) ... [2023-11-12 02:27:39,281 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:27:39,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:27:39,294 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-12 02:27:39,294 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:27:39,295 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:27:39,295 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:27:39,419 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:27:39,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:27:39,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:27:39,422 INFO L158 Benchmark]: Toolchain (without parser) took 5753.11ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 113.2MB in the beginning and 82.8MB in the end (delta: 30.3MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,422 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 159.4MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:27:39,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.76ms. Allocated memory is still 159.4MB. Free memory was 112.8MB in the beginning and 100.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.14ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 98.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,423 INFO L158 Benchmark]: Boogie Preprocessor took 57.01ms. Allocated memory is still 159.4MB. Free memory was 98.2MB in the beginning and 96.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,424 INFO L158 Benchmark]: RCFGBuilder took 563.67ms. Allocated memory is still 159.4MB. Free memory was 96.8MB in the beginning and 81.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,425 INFO L158 Benchmark]: TraceAbstraction took 4574.49ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 80.8MB in the beginning and 88.1MB in the end (delta: -7.3MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,425 INFO L158 Benchmark]: Witness Printer took 143.92ms. Allocated memory is still 192.9MB. Free memory was 88.1MB in the beginning and 82.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:27:39,428 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 159.4MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.76ms. Allocated memory is still 159.4MB. Free memory was 112.8MB in the beginning and 100.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.14ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 98.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.01ms. Allocated memory is still 159.4MB. Free memory was 98.2MB in the beginning and 96.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.67ms. Allocated memory is still 159.4MB. Free memory was 96.8MB in the beginning and 81.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4574.49ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 80.8MB in the beginning and 88.1MB in the end (delta: -7.3MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 143.92ms. Allocated memory is still 192.9MB. Free memory was 88.1MB in the beginning and 82.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 926 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 617 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 309 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 91 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 55 PreInvPairs, 63 NumberOfFragments, 125 HoareAnnotationTreeSize, 55 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 139 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 875/876 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: (((((1 <= k_loop) && (var_1_5 <= 255)) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256)))) || ((((last_1_var_1_10 + 10) <= 0) && ((var_1_10 + 10) <= 0)) && (0 <= k_loop))) RESULT: Ultimate proved your program to be correct! [2023-11-12 02:27:39,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3427ed8a-81f0-44c0-ad02-09cc13746fe7/bin/uautomizer-verify-uTZkv6EMXl/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 Writing output log to file Ultimate.log Result: TRUE