./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:02:32,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:02:32,322 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:02:32,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:02:32,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:02:32,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:02:32,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:02:32,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:02:32,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:02:32,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:02:32,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:02:32,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:02:32,394 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:02:32,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:02:32,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:02:32,397 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:02:32,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:02:32,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:02:32,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:02:32,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:02:32,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:02:32,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:02:32,401 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:02:32,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:02:32,402 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:02:32,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:02:32,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:02:32,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:02:32,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:32,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:02:32,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:02:32,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:02:32,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:02:32,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:02:32,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:02:32,408 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:02:32,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:02:32,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:02:32,409 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:02:32,409 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/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_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2023-11-06 22:02:32,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:02:32,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:02:32,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:02:32,826 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:02:32,826 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:02:32,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2023-11-06 22:02:35,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:02:36,186 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:02:36,186 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2023-11-06 22:02:36,196 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data/1c62d536f/5506442679074983ade0103a91b86441/FLAG13a348be1 [2023-11-06 22:02:36,213 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data/1c62d536f/5506442679074983ade0103a91b86441 [2023-11-06 22:02:36,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:02:36,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:02:36,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:36,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:02:36,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:02:36,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7472931f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36, skipping insertion in model container [2023-11-06 22:02:36,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,263 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:02:36,432 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2023-11-06 22:02:36,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:36,478 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:02:36,493 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2023-11-06 22:02:36,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:36,529 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:02:36,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36 WrapperNode [2023-11-06 22:02:36,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:36,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:36,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:02:36,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:02:36,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,583 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2023-11-06 22:02:36,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:36,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:02:36,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:02:36,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:02:36,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:02:36,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:02:36,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:02:36,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:02:36,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (1/1) ... [2023-11-06 22:02:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:36,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:02:36,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:02:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:02:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:02:36,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:02:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:02:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:02:36,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:02:36,833 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:02:36,836 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:02:37,100 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:02:37,108 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:02:37,108 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:02:37,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:37 BoogieIcfgContainer [2023-11-06 22:02:37,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:02:37,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:02:37,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:02:37,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:02:37,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:02:36" (1/3) ... [2023-11-06 22:02:37,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e21153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:37, skipping insertion in model container [2023-11-06 22:02:37,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:36" (2/3) ... [2023-11-06 22:02:37,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e21153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:02:37, skipping insertion in model container [2023-11-06 22:02:37,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:37" (3/3) ... [2023-11-06 22:02:37,121 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2023-11-06 22:02:37,142 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:02:37,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:02:37,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:02:37,203 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b657bae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:02:37,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:02:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:02:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:02:37,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:37,221 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:37,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:37,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 817351995, now seen corresponding path program 1 times [2023-11-06 22:02:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759964392] [2023-11-06 22:02:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759964392] [2023-11-06 22:02:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759964392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:37,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:37,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:02:37,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634244127] [2023-11-06 22:02:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:37,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:02:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:02:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:02:37,798 INFO L87 Difference]: Start difference. First operand has 49 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:02:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:37,835 INFO L93 Difference]: Finished difference Result 91 states and 150 transitions. [2023-11-06 22:02:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:02:37,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2023-11-06 22:02:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:37,846 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:02:37,846 INFO L226 Difference]: Without dead ends: 45 [2023-11-06 22:02:37,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-06 22:02:37,861 INFO L413 NwaCegarLoop]: 63 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, 63 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-06 22:02:37,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-06 22:02:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-06 22:02:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:02:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-11-06 22:02:37,932 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 81 [2023-11-06 22:02:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:37,937 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-11-06 22:02:37,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:02:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-11-06 22:02:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:02:37,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:37,948 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:37,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:02:37,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:37,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash -94067397, now seen corresponding path program 1 times [2023-11-06 22:02:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844328074] [2023-11-06 22:02:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844328074] [2023-11-06 22:02:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844328074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:38,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453069749] [2023-11-06 22:02:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:38,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:38,868 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:39,161 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2023-11-06 22:02:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2023-11-06 22:02:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:39,166 INFO L225 Difference]: With dead ends: 106 [2023-11-06 22:02:39,166 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 22:02:39,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:02:39,169 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 31 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:39,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:02:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 22:02:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2023-11-06 22:02:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:02:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2023-11-06 22:02:39,186 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 81 [2023-11-06 22:02:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:39,188 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2023-11-06 22:02:39,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2023-11-06 22:02:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:02:39,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:39,192 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:02:39,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:39,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -487094407, now seen corresponding path program 1 times [2023-11-06 22:02:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:39,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371549898] [2023-11-06 22:02:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:39,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371549898] [2023-11-06 22:02:39,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371549898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:39,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:39,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:39,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183152305] [2023-11-06 22:02:39,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:39,368 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:39,417 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2023-11-06 22:02:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:39,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2023-11-06 22:02:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:39,421 INFO L225 Difference]: With dead ends: 143 [2023-11-06 22:02:39,421 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:02:39,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:39,423 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:39,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 122 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:02:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-11-06 22:02:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 65 states have internal predecessors, (80), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:02:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2023-11-06 22:02:39,445 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 81 [2023-11-06 22:02:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:39,446 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2023-11-06 22:02:39,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2023-11-06 22:02:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:02:39,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:39,449 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:39,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:02:39,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:39,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -408172682, now seen corresponding path program 1 times [2023-11-06 22:02:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020293448] [2023-11-06 22:02:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020293448] [2023-11-06 22:02:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020293448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:41,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:02:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798764173] [2023-11-06 22:02:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:41,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:02:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:41,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:02:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:41,071 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:42,944 INFO L93 Difference]: Finished difference Result 171 states and 236 transitions. [2023-11-06 22:02:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:02:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-11-06 22:02:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:42,954 INFO L225 Difference]: With dead ends: 171 [2023-11-06 22:02:42,955 INFO L226 Difference]: Without dead ends: 169 [2023-11-06 22:02:42,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:02:42,957 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 154 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:42,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 543 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:02:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-06 22:02:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 124. [2023-11-06 22:02:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 91 states have internal predecessors, (111), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:02:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2023-11-06 22:02:43,019 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 83 [2023-11-06 22:02:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:43,021 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2023-11-06 22:02:43,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2023-11-06 22:02:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:02:43,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:43,026 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:43,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:02:43,026 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:43,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 271885688, now seen corresponding path program 1 times [2023-11-06 22:02:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289958176] [2023-11-06 22:02:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:43,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289958176] [2023-11-06 22:02:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289958176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:43,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:43,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:02:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658382344] [2023-11-06 22:02:43,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:43,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:02:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:02:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:43,986 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:45,646 INFO L93 Difference]: Finished difference Result 202 states and 275 transitions. [2023-11-06 22:02:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:02:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-11-06 22:02:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:45,651 INFO L225 Difference]: With dead ends: 202 [2023-11-06 22:02:45,651 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 22:02:45,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:02:45,654 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 165 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:45,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 582 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:02:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 22:02:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 127. [2023-11-06 22:02:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:02:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2023-11-06 22:02:45,704 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 83 [2023-11-06 22:02:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:45,705 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2023-11-06 22:02:45,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2023-11-06 22:02:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:02:45,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:45,708 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:45,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:02:45,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:45,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash -305913102, now seen corresponding path program 1 times [2023-11-06 22:02:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:45,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699765507] [2023-11-06 22:02:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:45,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699765507] [2023-11-06 22:02:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699765507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:02:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351956764] [2023-11-06 22:02:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:46,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:02:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:46,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:02:46,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:02:46,013 INFO L87 Difference]: Start difference. First operand 127 states and 175 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:46,109 INFO L93 Difference]: Finished difference Result 253 states and 348 transitions. [2023-11-06 22:02:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:02:46,110 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-11-06 22:02:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:46,118 INFO L225 Difference]: With dead ends: 253 [2023-11-06 22:02:46,118 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 22:02:46,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-06 22:02:46,126 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:46,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 196 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 22:02:46,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2023-11-06 22:02:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 94 states have internal predecessors, (113), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:02:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2023-11-06 22:02:46,194 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 83 [2023-11-06 22:02:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:46,196 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2023-11-06 22:02:46,196 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2023-11-06 22:02:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:02:46,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:46,200 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:46,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:02:46,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:46,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1352110223, now seen corresponding path program 1 times [2023-11-06 22:02:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:46,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111983584] [2023-11-06 22:02:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:46,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111983584] [2023-11-06 22:02:46,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111983584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:46,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:46,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414340837] [2023-11-06 22:02:46,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:46,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:46,292 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:46,370 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2023-11-06 22:02:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2023-11-06 22:02:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:46,373 INFO L225 Difference]: With dead ends: 266 [2023-11-06 22:02:46,374 INFO L226 Difference]: Without dead ends: 182 [2023-11-06 22:02:46,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:46,376 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 46 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:46,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 147 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-06 22:02:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2023-11-06 22:02:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 123 states have (on average 1.170731707317073) internal successors, (144), 125 states have internal predecessors, (144), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-06 22:02:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2023-11-06 22:02:46,441 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 84 [2023-11-06 22:02:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:46,442 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2023-11-06 22:02:46,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2023-11-06 22:02:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:02:46,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:46,444 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:46,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:02:46,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:46,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2028573053, now seen corresponding path program 1 times [2023-11-06 22:02:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818639117] [2023-11-06 22:02:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818639117] [2023-11-06 22:02:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818639117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319583103] [2023-11-06 22:02:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:46,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:46,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:46,530 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:46,614 INFO L93 Difference]: Finished difference Result 309 states and 419 transitions. [2023-11-06 22:02:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:46,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2023-11-06 22:02:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:46,618 INFO L225 Difference]: With dead ends: 309 [2023-11-06 22:02:46,618 INFO L226 Difference]: Without dead ends: 175 [2023-11-06 22:02:46,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:46,620 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:46,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 111 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-06 22:02:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2023-11-06 22:02:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 121 states have internal predecessors, (136), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-06 22:02:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2023-11-06 22:02:46,719 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 84 [2023-11-06 22:02:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:46,720 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2023-11-06 22:02:46,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2023-11-06 22:02:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 22:02:46,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:46,723 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:46,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:02:46,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:46,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash -25156310, now seen corresponding path program 1 times [2023-11-06 22:02:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44970800] [2023-11-06 22:02:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:46,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:47,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44970800] [2023-11-06 22:02:47,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44970800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:47,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:02:47,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841405147] [2023-11-06 22:02:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:47,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:02:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:02:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:02:47,013 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:47,243 INFO L93 Difference]: Finished difference Result 353 states and 471 transitions. [2023-11-06 22:02:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:02:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-06 22:02:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:47,247 INFO L225 Difference]: With dead ends: 353 [2023-11-06 22:02:47,248 INFO L226 Difference]: Without dead ends: 351 [2023-11-06 22:02:47,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:02:47,251 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:47,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 407 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:02:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-06 22:02:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 298. [2023-11-06 22:02:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 203 states have (on average 1.0935960591133005) internal successors, (222), 210 states have internal predecessors, (222), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-06 22:02:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 390 transitions. [2023-11-06 22:02:47,352 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 390 transitions. Word has length 85 [2023-11-06 22:02:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:47,353 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 390 transitions. [2023-11-06 22:02:47,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 390 transitions. [2023-11-06 22:02:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 22:02:47,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:47,355 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:02:47,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:47,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash -418183320, now seen corresponding path program 1 times [2023-11-06 22:02:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:47,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986183233] [2023-11-06 22:02:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986183233] [2023-11-06 22:02:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986183233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:48,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:48,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:02:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250612792] [2023-11-06 22:02:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:48,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:02:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:48,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:02:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:02:48,486 INFO L87 Difference]: Start difference. First operand 298 states and 390 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:50,399 INFO L93 Difference]: Finished difference Result 620 states and 816 transitions. [2023-11-06 22:02:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:02:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-06 22:02:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:50,404 INFO L225 Difference]: With dead ends: 620 [2023-11-06 22:02:50,404 INFO L226 Difference]: Without dead ends: 392 [2023-11-06 22:02:50,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:02:50,407 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 127 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:50,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 673 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:02:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-06 22:02:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 307. [2023-11-06 22:02:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 212 states have (on average 1.0943396226415094) internal successors, (232), 219 states have internal predecessors, (232), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-06 22:02:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 400 transitions. [2023-11-06 22:02:50,517 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 400 transitions. Word has length 85 [2023-11-06 22:02:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:50,518 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 400 transitions. [2023-11-06 22:02:50,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 400 transitions. [2023-11-06 22:02:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:02:50,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:50,521 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:50,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:02:50,522 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:50,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 843534070, now seen corresponding path program 1 times [2023-11-06 22:02:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724710232] [2023-11-06 22:02:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:50,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:02:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:02:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:02:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:02:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:02:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:02:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:02:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:02:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:02:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:02:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:02:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:02:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:02:50,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:02:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724710232] [2023-11-06 22:02:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724710232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:50,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:02:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638503917] [2023-11-06 22:02:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:50,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:02:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:50,618 INFO L87 Difference]: Start difference. First operand 307 states and 400 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:02:50,764 INFO L93 Difference]: Finished difference Result 648 states and 847 transitions. [2023-11-06 22:02:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-11-06 22:02:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:02:50,769 INFO L225 Difference]: With dead ends: 648 [2023-11-06 22:02:50,769 INFO L226 Difference]: Without dead ends: 411 [2023-11-06 22:02:50,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:50,771 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:02:50,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:02:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-06 22:02:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 342. [2023-11-06 22:02:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 233 states have (on average 1.0815450643776825) internal successors, (252), 242 states have internal predecessors, (252), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-06 22:02:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 444 transitions. [2023-11-06 22:02:50,917 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 444 transitions. Word has length 86 [2023-11-06 22:02:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:02:50,917 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 444 transitions. [2023-11-06 22:02:50,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:02:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 444 transitions. [2023-11-06 22:02:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:02:50,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:02:50,919 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:50,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:02:50,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:02:50,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2093744938, now seen corresponding path program 1 times [2023-11-06 22:02:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:02:50,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383345343] [2023-11-06 22:02:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:02:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:02:50,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:02:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:02:51,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:02:51,046 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:02:51,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:02:51,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:02:51,056 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:02:51,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:02:51,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:02:51 BoogieIcfgContainer [2023-11-06 22:02:51,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:02:51,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:02:51,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:02:51,195 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:02:51,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:02:37" (3/4) ... [2023-11-06 22:02:51,198 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:02:51,200 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:02:51,200 INFO L158 Benchmark]: Toolchain (without parser) took 14982.43ms. Allocated memory was 130.0MB in the beginning and 243.3MB in the end (delta: 113.2MB). Free memory was 65.8MB in the beginning and 208.8MB in the end (delta: -143.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:51,201 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 130.0MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:51,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.97ms. Allocated memory is still 130.0MB. Free memory was 65.6MB in the beginning and 54.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:02:51,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.50ms. Allocated memory is still 130.0MB. Free memory was 54.3MB in the beginning and 52.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:51,202 INFO L158 Benchmark]: Boogie Preprocessor took 57.18ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 52.4MB in the beginning and 137.4MB in the end (delta: -85.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2023-11-06 22:02:51,204 INFO L158 Benchmark]: RCFGBuilder took 467.74ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 124.9MB in the end (delta: 12.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-06 22:02:51,204 INFO L158 Benchmark]: TraceAbstraction took 14080.15ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 124.1MB in the beginning and 208.8MB in the end (delta: -84.7MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2023-11-06 22:02:51,205 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 243.3MB. Free memory is still 208.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:02:51,209 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.34ms. Allocated memory is still 130.0MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.97ms. Allocated memory is still 130.0MB. Free memory was 65.6MB in the beginning and 54.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.50ms. Allocated memory is still 130.0MB. Free memory was 54.3MB in the beginning and 52.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.18ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 52.4MB in the beginning and 137.4MB in the end (delta: -85.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.74ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 124.9MB in the end (delta: 12.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14080.15ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 124.1MB in the beginning and 208.8MB in the end (delta: -84.7MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 243.3MB. Free memory is still 208.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=-2, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [(-100 + var_1_1) ^ var_1_1=-2, isInitial=1, stepLocal_0=-2, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [(((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1)=1, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [(((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1)=1, (-100 + var_1_1) ^ var_1_1=-3, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [(((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1)=0, (-100 + var_1_1) ^ var_1_1=-3, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=49, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-2, var_1_6=51, var_1_7=49, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 756 mSDsluCounter, 3088 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2228 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1545 IncrementalHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 860 mSDtfsCounter, 1545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=11, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 348 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 905 ConstructedInterpolants, 0 QuantifiedInterpolants, 3590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:02:51,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:02:54,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:02:54,392 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:02:54,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:02:54,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:02:54,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:02:54,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:02:54,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:02:54,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:02:54,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:02:54,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:02:54,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:02:54,460 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:02:54,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:02:54,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:02:54,464 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:02:54,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:02:54,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:02:54,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:02:54,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:02:54,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:02:54,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:02:54,467 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:02:54,467 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:02:54,467 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:02:54,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:02:54,468 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:02:54,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:02:54,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:02:54,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:02:54,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:54,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:02:54,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:02:54,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:02:54,472 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:02:54,472 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:02:54,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:02:54,473 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:02:54,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:02:54,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:02:54,474 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:02:54,475 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:02:54,475 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/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_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2023-11-06 22:02:54,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:02:54,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:02:54,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:02:54,946 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:02:54,946 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:02:54,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2023-11-06 22:02:58,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:02:58,672 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:02:58,673 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2023-11-06 22:02:58,682 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data/2a87da601/1fadb4da9a7d48ef8014a7d9a93d8d91/FLAG13b9a45c0 [2023-11-06 22:02:58,699 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/data/2a87da601/1fadb4da9a7d48ef8014a7d9a93d8d91 [2023-11-06 22:02:58,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:02:58,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:02:58,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:58,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:02:58,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:02:58,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:58" (1/1) ... [2023-11-06 22:02:58,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168813ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:58, skipping insertion in model container [2023-11-06 22:02:58,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:02:58" (1/1) ... [2023-11-06 22:02:58,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:02:59,000 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2023-11-06 22:02:59,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:59,094 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:02:59,122 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_3880cefc-aa3b-42f0-801f-4ead21c4d852/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2023-11-06 22:02:59,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:02:59,179 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:02:59,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59 WrapperNode [2023-11-06 22:02:59,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:02:59,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:59,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:02:59,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:02:59,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,265 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2023-11-06 22:02:59,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:02:59,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:02:59,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:02:59,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:02:59,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:02:59,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:02:59,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:02:59,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:02:59,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (1/1) ... [2023-11-06 22:02:59,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:02:59,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:02:59,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:02:59,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:02:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:02:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:02:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:02:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:02:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:02:59,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:02:59,673 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:02:59,676 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:03:00,025 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:03:00,033 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:03:00,033 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:03:00,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:00 BoogieIcfgContainer [2023-11-06 22:03:00,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:03:00,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:03:00,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:03:00,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:03:00,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:02:58" (1/3) ... [2023-11-06 22:03:00,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365dc709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:03:00, skipping insertion in model container [2023-11-06 22:03:00,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:02:59" (2/3) ... [2023-11-06 22:03:00,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365dc709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:03:00, skipping insertion in model container [2023-11-06 22:03:00,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:00" (3/3) ... [2023-11-06 22:03:00,048 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2023-11-06 22:03:00,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:03:00,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:03:00,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:03:00,146 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e534504, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:03:00,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:03:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:03:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:03:00,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:00,170 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:00,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:00,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash 971633535, now seen corresponding path program 1 times [2023-11-06 22:03:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018802116] [2023-11-06 22:03:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:00,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:00,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:00,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:03:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:00,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:03:00,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2023-11-06 22:03:00,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:00,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018802116] [2023-11-06 22:03:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018802116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:03:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419664086] [2023-11-06 22:03:00,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:00,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:03:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:00,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:03:00,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:03:00,547 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-06 22:03:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:00,600 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2023-11-06 22:03:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:03:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 78 [2023-11-06 22:03:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:00,614 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:03:00,614 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:03:00,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-06 22:03:00,625 INFO L413 NwaCegarLoop]: 49 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, 49 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-06 22:03:00,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:03:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:03:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:03:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:03:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2023-11-06 22:03:00,696 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 78 [2023-11-06 22:03:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:00,697 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2023-11-06 22:03:00,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-06 22:03:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2023-11-06 22:03:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:03:00,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:00,703 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:00,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-06 22:03:00,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:00,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:00,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -483648641, now seen corresponding path program 1 times [2023-11-06 22:03:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:00,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682032064] [2023-11-06 22:03:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:00,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:00,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:00,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:00,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:03:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:01,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:03:01,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:03:02,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:02,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682032064] [2023-11-06 22:03:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682032064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:02,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:03:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121877361] [2023-11-06 22:03:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:02,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:03:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:03:02,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:03:02,666 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:03,298 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2023-11-06 22:03:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:03:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:03:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:03,303 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:03:03,303 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:03:03,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:03:03,306 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:03,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 270 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:03:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:03:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2023-11-06 22:03:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:03:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2023-11-06 22:03:03,334 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 78 [2023-11-06 22:03:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:03,336 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2023-11-06 22:03:03,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2023-11-06 22:03:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:03:03,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:03,339 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:03,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:03,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:03,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:03,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:03,567 INFO L85 PathProgramCache]: Analyzing trace with hash -481801599, now seen corresponding path program 1 times [2023-11-06 22:03:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795369414] [2023-11-06 22:03:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:03,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:03,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:03,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:03:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:03,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:03:03,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-06 22:03:05,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:03:07,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795369414] [2023-11-06 22:03:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795369414] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:07,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:03:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2023-11-06 22:03:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696454758] [2023-11-06 22:03:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:07,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:03:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:03:07,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:03:07,020 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:09,733 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2023-11-06 22:03:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:03:09,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:03:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:09,746 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:03:09,747 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 22:03:09,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:03:09,749 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 64 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:09,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 306 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:03:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 22:03:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 56. [2023-11-06 22:03:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:03:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2023-11-06 22:03:09,794 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 78 [2023-11-06 22:03:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:09,795 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2023-11-06 22:03:09,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2023-11-06 22:03:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:03:09,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:09,803 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:09,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-06 22:03:10,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:10,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:10,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1291358721, now seen corresponding path program 1 times [2023-11-06 22:03:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402395773] [2023-11-06 22:03:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:10,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:10,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:10,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:03:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:10,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:03:10,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:03:10,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:03:10,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402395773] [2023-11-06 22:03:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402395773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:10,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:03:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897377466] [2023-11-06 22:03:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:10,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:03:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:03:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:03:10,850 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:11,013 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2023-11-06 22:03:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:03:11,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:03:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:11,016 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:03:11,016 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:03:11,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:03:11,018 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 36 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:11,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 316 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:03:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:03:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2023-11-06 22:03:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:03:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2023-11-06 22:03:11,043 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 78 [2023-11-06 22:03:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:11,044 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2023-11-06 22:03:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2023-11-06 22:03:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:03:11,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:11,047 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:11,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:11,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:11,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:11,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1293205763, now seen corresponding path program 1 times [2023-11-06 22:03:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:11,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134281170] [2023-11-06 22:03:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:11,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:11,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:03:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:11,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:03:11,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-06 22:03:11,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:11,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134281170] [2023-11-06 22:03:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134281170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [529711926] [2023-11-06 22:03:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:03:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:03:11,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:03:11,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-06 22:03:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:12,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:03:12,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-06 22:03:12,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [529711926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:12,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:03:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-11-06 22:03:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799507260] [2023-11-06 22:03:12,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:03:12,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:03:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:03:12,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:03:12,407 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:03:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:12,688 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions. [2023-11-06 22:03:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:03:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2023-11-06 22:03:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:12,699 INFO L225 Difference]: With dead ends: 168 [2023-11-06 22:03:12,700 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:03:12,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:03:12,704 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:12,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 123 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:03:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:03:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-11-06 22:03:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 68 states have internal predecessors, (71), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:03:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions. [2023-11-06 22:03:12,750 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 78 [2023-11-06 22:03:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:12,751 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions. [2023-11-06 22:03:12,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:03:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions. [2023-11-06 22:03:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 22:03:12,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:03:12,755 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:12,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:12,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 22:03:13,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:03:13,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 287456292, now seen corresponding path program 1 times [2023-11-06 22:03:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821913760] [2023-11-06 22:03:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:13,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:03:13,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:03:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:13,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:03:13,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:03:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 729 proven. 196 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2023-11-06 22:03:17,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:03:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2023-11-06 22:03:20,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:03:20,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821913760] [2023-11-06 22:03:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821913760] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:03:20,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:03:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2023-11-06 22:03:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754473509] [2023-11-06 22:03:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:03:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:03:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:03:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:03:20,222 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:03:25,939 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2023-11-06 22:03:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:03:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 153 [2023-11-06 22:03:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:03:25,941 INFO L225 Difference]: With dead ends: 139 [2023-11-06 22:03:25,942 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:03:25,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:03:25,946 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:03:25,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 319 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:03:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:03:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:03:25,948 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-06 22:03:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:03:25,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2023-11-06 22:03:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:03:25,949 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:03:25,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:03:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:03:25,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:03:25,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:03:25,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:26,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:03:26,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:03:29,236 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-06 22:03:29,237 INFO L902 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: true [2023-11-06 22:03:29,237 INFO L902 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: true [2023-11-06 22:03:29,237 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:03:29,237 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:03:29,238 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) (or (and .cse0 (let ((.cse3 (bvadd ((_ sign_extend 24) ~var_1_6~0) ((_ sign_extend 24) ~var_1_5~0))) (.cse1 ((_ sign_extend 24) ~var_1_7~0))) (let ((.cse2 (bvslt .cse3 .cse1))) (or (and (= ((_ extract 7 0) .cse1) ~var_1_1~0) (not .cse2)) (and .cse2 (= ~var_1_1~0 ((_ extract 7 0) .cse3))))))) (and .cse0 (or (and (= ~var_1_2~0 (_ bv0 8)) (= ~var_1_3~0 (_ bv0 8))) (= ~var_1_4~0 (_ bv0 8)))))) [2023-11-06 22:03:29,238 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-06 22:03:29,238 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 67 78) the Hoare annotation is: false [2023-11-06 22:03:29,238 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 40) no Hoare annotation was computed. [2023-11-06 22:03:29,238 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:03:29,238 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 62) no Hoare annotation was computed. [2023-11-06 22:03:29,238 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:03:29,239 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:03:29,239 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-06 22:03:29,239 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2023-11-06 22:03:29,239 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2023-11-06 22:03:29,239 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 63 66) the Hoare annotation is: (let ((.cse6 ((_ sign_extend 24) ~var_1_5~0))) (let ((.cse2 (let ((.cse10 (bvadd ((_ sign_extend 24) ~var_1_6~0) .cse6)) (.cse8 ((_ sign_extend 24) ~var_1_7~0))) (let ((.cse9 (bvslt .cse10 .cse8))) (or (and (= ((_ extract 7 0) .cse8) ~var_1_1~0) (not .cse9)) (and .cse9 (= ~var_1_1~0 ((_ extract 7 0) .cse10))))))) (.cse3 (not (= |ULTIMATE.start_property_#res#1| (_ bv0 32)))) (.cse4 (not (bvsgt .cse6 (let ((.cse7 ((_ sign_extend 24) ~var_1_1~0))) (bvxor (bvadd (_ bv4294967196 32) .cse7) .cse7))))) (.cse0 (= ~var_1_6~0 ~var_1_8~0)) (.cse5 (or (and (= ~var_1_2~0 (_ bv0 8)) (= ~var_1_3~0 (_ bv0 8))) (= ~var_1_4~0 (_ bv0 8)))) (.cse1 (= |ULTIMATE.start_property_#res#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 .cse1)))) [2023-11-06 22:03:29,240 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-11-06 22:03:29,240 INFO L895 garLoopResultBuilder]: At program point L70-2(lines 70 76) the Hoare annotation is: (let ((.cse4 ((_ sign_extend 24) ~var_1_5~0)) (.cse1 ((_ sign_extend 24) ~var_1_1~0))) (or (let ((.cse3 (bvadd ((_ sign_extend 24) ~var_1_6~0) .cse4)) (.cse0 ((_ sign_extend 24) ~var_1_7~0))) (let ((.cse2 (bvslt .cse3 .cse0))) (and (or (= ((_ sign_extend 24) ((_ extract 7 0) .cse0)) .cse1) .cse2) (or (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse1) (not .cse2))))) (and (= ~var_1_2~0 (_ bv0 8)) (= ~var_1_3~0 (_ bv0 8))) (= ~var_1_4~0 (_ bv0 8)) (bvsgt .cse4 (bvxor (bvadd (_ bv4294967196 32) .cse1) .cse1)))) [2023-11-06 22:03:29,240 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 76) no Hoare annotation was computed. [2023-11-06 22:03:29,240 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2023-11-06 22:03:29,240 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:03:29,241 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 35) no Hoare annotation was computed. [2023-11-06 22:03:29,241 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2023-11-06 22:03:29,241 INFO L902 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: true [2023-11-06 22:03:29,241 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-06 22:03:29,242 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2023-11-06 22:03:29,242 INFO L902 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: true [2023-11-06 22:03:29,242 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:03:29,242 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 31) no Hoare annotation was computed. [2023-11-06 22:03:29,242 INFO L899 garLoopResultBuilder]: For program point L59(lines 41 60) no Hoare annotation was computed. [2023-11-06 22:03:29,243 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-11-06 22:03:29,243 INFO L902 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: true [2023-11-06 22:03:29,243 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-06 22:03:29,243 INFO L902 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: true [2023-11-06 22:03:29,243 INFO L902 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: true [2023-11-06 22:03:29,244 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:03:29,244 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:03:29,244 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:03:29,244 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:03:29,248 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:03:29,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:03:29,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:03:29 BoogieIcfgContainer [2023-11-06 22:03:29,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:03:29,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:03:29,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:03:29,273 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:03:29,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:00" (3/4) ... [2023-11-06 22:03:29,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:03:29,282 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:03:29,287 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:03:29,288 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:03:29,289 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:03:29,289 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:03:29,322 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_6 == var_1_8) && (\result == 1)) && ((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127))))) || ((((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127)))) && !((\result == 0))) && !((var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))))) || (((((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0)) && !((\result == 0))) && !((var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))))) || (((var_1_6 == var_1_8) && (((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0))) && (\result == 1))) [2023-11-06 22:03:29,348 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_6 == var_1_8) && (\result == 1)) && ((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127))))) || ((((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127)))) && !((\result == 0))) && !((var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))))) || (((((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0)) && !((\result == 0))) && !((var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))))) || (((var_1_6 == var_1_8) && (((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0))) && (\result == 1))) [2023-11-06 22:03:29,363 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:03:29,363 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:03:29,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:03:29,365 INFO L158 Benchmark]: Toolchain (without parser) took 30660.96ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 56.3MB in the beginning and 139.1MB in the end (delta: -82.8MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,365 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 79.7MB. Free memory was 55.5MB in the beginning and 55.5MB in the end (delta: 22.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:29,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.55ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 44.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.67ms. Allocated memory is still 79.7MB. Free memory was 44.3MB in the beginning and 42.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,367 INFO L158 Benchmark]: Boogie Preprocessor took 75.24ms. Allocated memory is still 79.7MB. Free memory was 42.7MB in the beginning and 41.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,367 INFO L158 Benchmark]: RCFGBuilder took 692.87ms. Allocated memory is still 79.7MB. Free memory was 41.1MB in the beginning and 48.0MB in the end (delta: -6.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,368 INFO L158 Benchmark]: TraceAbstraction took 29232.33ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 47.4MB in the beginning and 143.3MB in the end (delta: -96.0MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,368 INFO L158 Benchmark]: Witness Printer took 91.15ms. Allocated memory is still 180.4MB. Free memory was 143.3MB in the beginning and 139.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:03:29,370 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.30ms. Allocated memory is still 79.7MB. Free memory was 55.5MB in the beginning and 55.5MB in the end (delta: 22.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.55ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 44.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.67ms. Allocated memory is still 79.7MB. Free memory was 44.3MB in the beginning and 42.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.24ms. Allocated memory is still 79.7MB. Free memory was 42.7MB in the beginning and 41.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 692.87ms. Allocated memory is still 79.7MB. Free memory was 41.1MB in the beginning and 48.0MB in the end (delta: -6.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29232.33ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 47.4MB in the beginning and 143.3MB in the end (delta: -96.0MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Witness Printer took 91.15ms. Allocated memory is still 180.4MB. Free memory was 143.3MB in the beginning and 139.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 1383 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 965 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 510 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 418 mSDtfsCounter, 510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 944 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 124 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 94 PreInvPairs, 155 NumberOfFragments, 262 HoareAnnotationTreeSize, 94 FomulaSimplifications, 4463 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 17 FomulaSimplificationsInter, 6131 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 621 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 843 ConstructedInterpolants, 82 QuantifiedInterpolants, 4356 SizeOfPredicates, 71 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 3858/4108 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: 70]: Loop Invariant Derived loop invariant: (((((((var_1_7 & 127) == var_1_1) || (((var_1_6 + var_1_5) % 4294967296) < var_1_7)) && (((((var_1_6 + var_1_5) % 4294967296) & 127) == var_1_1) || !((((var_1_6 + var_1_5) % 4294967296) < var_1_7)))) || ((var_1_2 == 0) && (var_1_3 == 0))) || (var_1_4 == 0)) || (var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: ((((((var_1_6 == var_1_8) && (\result == 1)) && ((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127))))) || ((((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127)))) && !((\result == 0))) && !((var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))))) || (((((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0)) && !((\result == 0))) && !((var_1_5 > (((-100 + var_1_1) % 4294967296) ^ var_1_1))))) || (((var_1_6 == var_1_8) && (((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0))) && (\result == 1))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((!((cond == 0)) && ((((var_1_7 & 127) == var_1_1) && !((((var_1_6 + var_1_5) % 4294967296) < var_1_7))) || ((((var_1_6 + var_1_5) % 4294967296) < var_1_7) && (var_1_1 == (((var_1_6 + var_1_5) % 4294967296) & 127))))) || (!((cond == 0)) && (((var_1_2 == 0) && (var_1_3 == 0)) || (var_1_4 == 0)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:03:29,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3880cefc-aa3b-42f0-801f-4ead21c4d852/bin/uautomizer-verify-WvqO1wxjHP/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