./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:57:44,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:57:45,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:57:45,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:57:45,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:57:45,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:57:45,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:57:45,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:57:45,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:57:45,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:57:45,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:57:45,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:57:45,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:57:45,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:57:45,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:57:45,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:57:45,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:57:45,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:57:45,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:57:45,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:57:45,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:57:45,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:45,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:57:45,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:57:45,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:57:45,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:57:45,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:57:45,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:57:45,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:57:45,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:57:45,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:57:45,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2024-11-07 06:57:45,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:57:45,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:57:45,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:57:45,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:57:45,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:57:45,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-11-07 06:57:46,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:57:46,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:57:46,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-11-07 06:57:46,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a969a20c6/3eb7560be5224a4a91a83ee739d833b5/FLAGb1d1b35ce [2024-11-07 06:57:47,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a969a20c6/3eb7560be5224a4a91a83ee739d833b5 [2024-11-07 06:57:47,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:57:47,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:57:47,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:47,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:57:47,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:57:47,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1c9810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47, skipping insertion in model container [2024-11-07 06:57:47,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:57:47,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2024-11-07 06:57:47,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:47,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:57:47,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2024-11-07 06:57:47,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:47,602 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:57:47,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47 WrapperNode [2024-11-07 06:57:47,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:47,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:47,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:57:47,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:57:47,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,685 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-11-07 06:57:47,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:47,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:57:47,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:57:47,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:57:47,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,736 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:57:47,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:57:47,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:57:47,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:57:47,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:57:47,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (1/1) ... [2024-11-07 06:57:47,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:47,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:47,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:57:47,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:57:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:57:47,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:57:47,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:57:47,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:57:47,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:57:47,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:57:47,923 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:57:47,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:57:48,377 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 06:57:48,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:57:48,389 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:57:48,391 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:57:48,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:48 BoogieIcfgContainer [2024-11-07 06:57:48,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:57:48,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:57:48,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:57:48,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:57:48,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:57:47" (1/3) ... [2024-11-07 06:57:48,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e50467a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:48, skipping insertion in model container [2024-11-07 06:57:48,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:47" (2/3) ... [2024-11-07 06:57:48,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e50467a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:48, skipping insertion in model container [2024-11-07 06:57:48,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:48" (3/3) ... [2024-11-07 06:57:48,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-11-07 06:57:48,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:57:48,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:57:48,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:57:48,472 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a38ac3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:57:48,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:57:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:57:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:57:48,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:48,491 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:48,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1889892760, now seen corresponding path program 1 times [2024-11-07 06:57:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153609985] [2024-11-07 06:57:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:48,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:57:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:57:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:57:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:57:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:57:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:57:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:57:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:57:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:57:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:57:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:57:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:57:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:57:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:57:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:57:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:57:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:57:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:57:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:57:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:57:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153609985] [2024-11-07 06:57:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153609985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:49,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:57:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327685181] [2024-11-07 06:57:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:57:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:57:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:49,029 INFO L87 Difference]: Start difference. First operand has 110 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:57:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:49,054 INFO L93 Difference]: Finished difference Result 213 states and 374 transitions. [2024-11-07 06:57:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:57:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-07 06:57:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:49,064 INFO L225 Difference]: With dead ends: 213 [2024-11-07 06:57:49,064 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 06:57:49,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:49,069 INFO L432 NwaCegarLoop]: 167 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, 167 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 [2024-11-07 06:57:49,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 06:57:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 06:57:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:57:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-11-07 06:57:49,116 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 209 [2024-11-07 06:57:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:49,116 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-11-07 06:57:49,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:57:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-11-07 06:57:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:57:49,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:49,122 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:49,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:57:49,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:49,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash -717082412, now seen corresponding path program 1 times [2024-11-07 06:57:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:49,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251838181] [2024-11-07 06:57:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:57:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:57:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:57:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:57:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:57:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:57:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:57:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:57:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:57:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:57:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:57:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:57:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:57:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:57:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:57:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:57:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:57:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:57:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:57:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:57:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251838181] [2024-11-07 06:57:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251838181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:57:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237206889] [2024-11-07 06:57:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:49,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:49,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:49,482 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:49,530 INFO L93 Difference]: Finished difference Result 206 states and 325 transitions. [2024-11-07 06:57:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:49,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-07 06:57:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:49,536 INFO L225 Difference]: With dead ends: 206 [2024-11-07 06:57:49,536 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 06:57:49,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:49,540 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:49,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 151 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 06:57:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 06:57:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:57:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2024-11-07 06:57:49,558 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 209 [2024-11-07 06:57:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:49,559 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2024-11-07 06:57:49,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2024-11-07 06:57:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-07 06:57:49,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:49,562 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:57:49,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -141581639, now seen corresponding path program 1 times [2024-11-07 06:57:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803988063] [2024-11-07 06:57:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:57:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:57:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:57:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:57:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:57:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:57:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:57:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:57:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:57:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:57:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:57:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:57:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:57:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:57:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:57:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:57:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:57:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:57:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:57:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:57:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803988063] [2024-11-07 06:57:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803988063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:54,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 06:57:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774726973] [2024-11-07 06:57:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:54,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:57:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:57:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:57:54,474 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:57,351 INFO L93 Difference]: Finished difference Result 387 states and 554 transitions. [2024-11-07 06:57:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:57:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-11-07 06:57:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:57,357 INFO L225 Difference]: With dead ends: 387 [2024-11-07 06:57:57,359 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 06:57:57,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:57:57,361 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 324 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:57,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 883 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 06:57:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 06:57:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 155. [2024-11-07 06:57:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 119 states have internal predecessors, (164), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 06:57:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 232 transitions. [2024-11-07 06:57:57,396 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 232 transitions. Word has length 210 [2024-11-07 06:57:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:57,397 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 232 transitions. [2024-11-07 06:57:57,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:57:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 232 transitions. [2024-11-07 06:57:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:57:57,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:57,404 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:57:57,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1095042398, now seen corresponding path program 1 times [2024-11-07 06:57:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631113855] [2024-11-07 06:57:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:57,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:01,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631113855] [2024-11-07 06:58:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631113855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:01,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:01,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 06:58:01,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643019635] [2024-11-07 06:58:01,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:01,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:58:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:58:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:58:01,613 INFO L87 Difference]: Start difference. First operand 155 states and 232 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:05,385 INFO L93 Difference]: Finished difference Result 405 states and 591 transitions. [2024-11-07 06:58:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:58:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:58:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:05,390 INFO L225 Difference]: With dead ends: 405 [2024-11-07 06:58:05,390 INFO L226 Difference]: Without dead ends: 253 [2024-11-07 06:58:05,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-11-07 06:58:05,391 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 418 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:05,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 628 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 06:58:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-07 06:58:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 155. [2024-11-07 06:58:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 119 states have internal predecessors, (164), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 06:58:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 232 transitions. [2024-11-07 06:58:05,419 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 232 transitions. Word has length 211 [2024-11-07 06:58:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 232 transitions. [2024-11-07 06:58:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 232 transitions. [2024-11-07 06:58:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:58:05,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:05,424 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:05,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:58:05,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:05,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1510981156, now seen corresponding path program 1 times [2024-11-07 06:58:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414830743] [2024-11-07 06:58:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414830743] [2024-11-07 06:58:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414830743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:07,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:58:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265550485] [2024-11-07 06:58:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:07,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:58:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:07,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:58:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:58:07,475 INFO L87 Difference]: Start difference. First operand 155 states and 232 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:08,334 INFO L93 Difference]: Finished difference Result 371 states and 546 transitions. [2024-11-07 06:58:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:58:08,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:58:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:08,340 INFO L225 Difference]: With dead ends: 371 [2024-11-07 06:58:08,340 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 06:58:08,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:58:08,341 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 69 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:08,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 561 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:58:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 06:58:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2024-11-07 06:58:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 158 states have (on average 1.3544303797468353) internal successors, (214), 161 states have internal predecessors, (214), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:58:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 294 transitions. [2024-11-07 06:58:08,365 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 294 transitions. Word has length 211 [2024-11-07 06:58:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:08,366 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 294 transitions. [2024-11-07 06:58:08,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 294 transitions. [2024-11-07 06:58:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:58:08,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:08,369 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:58:08,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:08,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash -550743292, now seen corresponding path program 1 times [2024-11-07 06:58:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865156245] [2024-11-07 06:58:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865156245] [2024-11-07 06:58:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865156245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:09,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:58:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121275030] [2024-11-07 06:58:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:09,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:58:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:58:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:58:09,202 INFO L87 Difference]: Start difference. First operand 203 states and 294 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:09,513 INFO L93 Difference]: Finished difference Result 464 states and 665 transitions. [2024-11-07 06:58:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:58:09,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:58:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:09,516 INFO L225 Difference]: With dead ends: 464 [2024-11-07 06:58:09,516 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 06:58:09,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:58:09,518 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 42 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:09,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 725 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:58:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 06:58:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 210. [2024-11-07 06:58:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 165 states have (on average 1.3515151515151516) internal successors, (223), 168 states have internal predecessors, (223), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:58:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 303 transitions. [2024-11-07 06:58:09,538 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 303 transitions. Word has length 211 [2024-11-07 06:58:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 303 transitions. [2024-11-07 06:58:09,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 303 transitions. [2024-11-07 06:58:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:58:09,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:09,540 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:58:09,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1561860542, now seen corresponding path program 1 times [2024-11-07 06:58:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764276417] [2024-11-07 06:58:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764276417] [2024-11-07 06:58:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764276417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:10,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:58:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976503558] [2024-11-07 06:58:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:10,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:58:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:58:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:58:10,013 INFO L87 Difference]: Start difference. First operand 210 states and 303 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:10,223 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2024-11-07 06:58:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:58:10,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:58:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:10,226 INFO L225 Difference]: With dead ends: 455 [2024-11-07 06:58:10,226 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 06:58:10,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:58:10,229 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 72 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:10,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 596 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:58:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 06:58:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 177. [2024-11-07 06:58:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.335820895522388) internal successors, (179), 136 states have internal predecessors, (179), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:58:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions. [2024-11-07 06:58:10,257 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 211 [2024-11-07 06:58:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:10,258 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 255 transitions. [2024-11-07 06:58:10,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-07 06:58:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 06:58:10,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:10,259 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:10,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:58:10,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:10,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1169836212, now seen corresponding path program 1 times [2024-11-07 06:58:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:10,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058766502] [2024-11-07 06:58:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058766502] [2024-11-07 06:58:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058766502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 06:58:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616065028] [2024-11-07 06:58:12,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:58:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:58:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:58:12,221 INFO L87 Difference]: Start difference. First operand 177 states and 255 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:12,940 INFO L93 Difference]: Finished difference Result 487 states and 689 transitions. [2024-11-07 06:58:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:58:12,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-07 06:58:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:12,943 INFO L225 Difference]: With dead ends: 487 [2024-11-07 06:58:12,943 INFO L226 Difference]: Without dead ends: 313 [2024-11-07 06:58:12,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:58:12,945 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 99 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:12,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 829 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:58:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-07 06:58:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 207. [2024-11-07 06:58:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 166 states have internal predecessors, (220), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:58:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2024-11-07 06:58:12,977 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 212 [2024-11-07 06:58:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:12,978 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2024-11-07 06:58:12,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2024-11-07 06:58:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 06:58:12,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:12,979 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:12,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:58:12,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:12,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1870900790, now seen corresponding path program 1 times [2024-11-07 06:58:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242108804] [2024-11-07 06:58:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242108804] [2024-11-07 06:58:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242108804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:14,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 06:58:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099084797] [2024-11-07 06:58:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 06:58:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 06:58:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:58:14,859 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:15,443 INFO L93 Difference]: Finished difference Result 493 states and 697 transitions. [2024-11-07 06:58:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:58:15,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-07 06:58:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:15,446 INFO L225 Difference]: With dead ends: 493 [2024-11-07 06:58:15,447 INFO L226 Difference]: Without dead ends: 289 [2024-11-07 06:58:15,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:58:15,449 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 86 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:15,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 817 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:58:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-07 06:58:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 207. [2024-11-07 06:58:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 166 states have internal predecessors, (220), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:58:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2024-11-07 06:58:15,474 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 212 [2024-11-07 06:58:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:15,476 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2024-11-07 06:58:15,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2024-11-07 06:58:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 06:58:15,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:15,478 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:15,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 06:58:15,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 583030198, now seen corresponding path program 1 times [2024-11-07 06:58:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437064366] [2024-11-07 06:58:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:15,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437064366] [2024-11-07 06:58:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437064366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 06:58:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896029289] [2024-11-07 06:58:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:58:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:17,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:58:17,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:58:17,782 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:18,551 INFO L93 Difference]: Finished difference Result 523 states and 736 transitions. [2024-11-07 06:58:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:58:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-07 06:58:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:18,554 INFO L225 Difference]: With dead ends: 523 [2024-11-07 06:58:18,554 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 06:58:18,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:58:18,556 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 99 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:18,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 836 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:58:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 06:58:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 211. [2024-11-07 06:58:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.3452380952380953) internal successors, (226), 170 states have internal predecessors, (226), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:58:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2024-11-07 06:58:18,577 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 212 [2024-11-07 06:58:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:18,577 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2024-11-07 06:58:18,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2024-11-07 06:58:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 06:58:18,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:18,579 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:18,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 06:58:18,580 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1284094776, now seen corresponding path program 1 times [2024-11-07 06:58:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245752002] [2024-11-07 06:58:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:20,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245752002] [2024-11-07 06:58:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245752002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 06:58:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917313685] [2024-11-07 06:58:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 06:58:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 06:58:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:58:20,748 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:58:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:22,590 INFO L93 Difference]: Finished difference Result 533 states and 748 transitions. [2024-11-07 06:58:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 06:58:22,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 212 [2024-11-07 06:58:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:22,593 INFO L225 Difference]: With dead ends: 533 [2024-11-07 06:58:22,593 INFO L226 Difference]: Without dead ends: 325 [2024-11-07 06:58:22,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2024-11-07 06:58:22,594 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 375 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:22,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 609 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 06:58:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-07 06:58:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 207. [2024-11-07 06:58:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 166 states have internal predecessors, (220), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:58:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2024-11-07 06:58:22,618 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 212 [2024-11-07 06:58:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2024-11-07 06:58:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:58:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2024-11-07 06:58:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 06:58:22,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:22,620 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:22,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 06:58:22,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -277919139, now seen corresponding path program 1 times [2024-11-07 06:58:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046606545] [2024-11-07 06:58:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046606545] [2024-11-07 06:58:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046606545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:58:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135815316] [2024-11-07 06:58:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:58:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:58:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:58:22,868 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:23,064 INFO L93 Difference]: Finished difference Result 587 states and 841 transitions. [2024-11-07 06:58:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:58:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-07 06:58:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:23,067 INFO L225 Difference]: With dead ends: 587 [2024-11-07 06:58:23,067 INFO L226 Difference]: Without dead ends: 383 [2024-11-07 06:58:23,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:58:23,070 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 117 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:23,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 525 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:58:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-07 06:58:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 281. [2024-11-07 06:58:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 205 states have internal predecessors, (266), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 06:58:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 406 transitions. [2024-11-07 06:58:23,113 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 406 transitions. Word has length 213 [2024-11-07 06:58:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 406 transitions. [2024-11-07 06:58:23,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 406 transitions. [2024-11-07 06:58:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 06:58:23,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:23,117 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 06:58:23,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1606123261, now seen corresponding path program 1 times [2024-11-07 06:58:23,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76163731] [2024-11-07 06:58:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:23,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76163731] [2024-11-07 06:58:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76163731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:58:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843655155] [2024-11-07 06:58:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:23,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:58:23,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:23,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:58:23,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:23,215 INFO L87 Difference]: Start difference. First operand 281 states and 406 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:23,329 INFO L93 Difference]: Finished difference Result 515 states and 736 transitions. [2024-11-07 06:58:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:58:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-07 06:58:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:23,332 INFO L225 Difference]: With dead ends: 515 [2024-11-07 06:58:23,332 INFO L226 Difference]: Without dead ends: 311 [2024-11-07 06:58:23,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:23,333 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 39 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:23,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 257 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:58:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-07 06:58:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2024-11-07 06:58:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 212 states have internal predecessors, (272), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 06:58:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 412 transitions. [2024-11-07 06:58:23,365 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 412 transitions. Word has length 213 [2024-11-07 06:58:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:23,366 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 412 transitions. [2024-11-07 06:58:23,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 412 transitions. [2024-11-07 06:58:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 06:58:23,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:23,367 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:23,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 06:58:23,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:23,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 354889227, now seen corresponding path program 1 times [2024-11-07 06:58:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:23,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215265663] [2024-11-07 06:58:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215265663] [2024-11-07 06:58:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215265663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:23,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:58:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961970775] [2024-11-07 06:58:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:23,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:58:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:58:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:23,459 INFO L87 Difference]: Start difference. First operand 288 states and 412 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:23,566 INFO L93 Difference]: Finished difference Result 526 states and 741 transitions. [2024-11-07 06:58:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:58:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-07 06:58:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:23,569 INFO L225 Difference]: With dead ends: 526 [2024-11-07 06:58:23,569 INFO L226 Difference]: Without dead ends: 315 [2024-11-07 06:58:23,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:23,570 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 46 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:23,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 274 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:58:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-07 06:58:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 273. [2024-11-07 06:58:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 197 states have (on average 1.284263959390863) internal successors, (253), 198 states have internal predecessors, (253), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 06:58:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 389 transitions. [2024-11-07 06:58:23,604 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 389 transitions. Word has length 213 [2024-11-07 06:58:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:23,605 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 389 transitions. [2024-11-07 06:58:23,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 389 transitions. [2024-11-07 06:58:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:58:23,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:23,606 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:23,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 06:58:23,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1902979921, now seen corresponding path program 1 times [2024-11-07 06:58:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:23,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837709078] [2024-11-07 06:58:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:58:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:58:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:58:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:58:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:58:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:58:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:58:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:58:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:58:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:58:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:58:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 06:58:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:58:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 06:58:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 06:58:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 06:58:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:58:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 06:58:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:58:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 06:58:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:58:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:58:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:58:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:58:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:58:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:58:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:58:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:58:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:58:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:58:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 06:58:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 06:58:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 102 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2024-11-07 06:58:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837709078] [2024-11-07 06:58:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837709078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:58:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139804704] [2024-11-07 06:58:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:24,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:58:24,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:58:24,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:58:24,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:58:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:24,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 06:58:24,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-07 06:58:25,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-07 06:58:25,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139804704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:58:25,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:58:25,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2024-11-07 06:58:25,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250103281] [2024-11-07 06:58:25,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:58:25,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 06:58:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:25,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 06:58:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-07 06:58:25,762 INFO L87 Difference]: Start difference. First operand 273 states and 389 transitions. Second operand has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 21 states have internal predecessors, (135), 8 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 8 states have call predecessors, (84), 8 states have call successors, (84) [2024-11-07 06:58:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:26,921 INFO L93 Difference]: Finished difference Result 523 states and 730 transitions. [2024-11-07 06:58:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-07 06:58:26,922 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 21 states have internal predecessors, (135), 8 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 8 states have call predecessors, (84), 8 states have call successors, (84) Word has length 214 [2024-11-07 06:58:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:26,925 INFO L225 Difference]: With dead ends: 523 [2024-11-07 06:58:26,925 INFO L226 Difference]: Without dead ends: 325 [2024-11-07 06:58:26,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 06:58:26,928 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 439 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:26,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 737 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:58:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-07 06:58:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 295. [2024-11-07 06:58:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 215 states have (on average 1.255813953488372) internal successors, (270), 216 states have internal predecessors, (270), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 06:58:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 406 transitions. [2024-11-07 06:58:26,964 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 406 transitions. Word has length 214 [2024-11-07 06:58:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:26,965 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 406 transitions. [2024-11-07 06:58:26,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 21 states have internal predecessors, (135), 8 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 8 states have call predecessors, (84), 8 states have call successors, (84) [2024-11-07 06:58:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 406 transitions. [2024-11-07 06:58:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:58:26,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:26,966 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:26,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:58:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 06:58:27,167 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -944782861, now seen corresponding path program 1 times [2024-11-07 06:58:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738425000] [2024-11-07 06:58:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:58:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864414101] [2024-11-07 06:58:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:27,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:58:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:58:27,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:58:27,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:58:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:27,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 06:58:27,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-11-07 06:58:27,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 138 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-11-07 06:58:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:58:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738425000] [2024-11-07 06:58:28,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:58:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864414101] [2024-11-07 06:58:28,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864414101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:58:28,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:58:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-07 06:58:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074836907] [2024-11-07 06:58:28,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:58:28,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:58:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:58:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:58:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:58:28,378 INFO L87 Difference]: Start difference. First operand 295 states and 406 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-11-07 06:58:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:28,751 INFO L93 Difference]: Finished difference Result 549 states and 735 transitions. [2024-11-07 06:58:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 06:58:28,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 214 [2024-11-07 06:58:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:28,754 INFO L225 Difference]: With dead ends: 549 [2024-11-07 06:58:28,755 INFO L226 Difference]: Without dead ends: 331 [2024-11-07 06:58:28,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2024-11-07 06:58:28,756 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 353 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:28,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 186 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:58:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-07 06:58:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 323. [2024-11-07 06:58:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 236 states have (on average 1.2245762711864407) internal successors, (289), 237 states have internal predecessors, (289), 68 states have call successors, (68), 18 states have call predecessors, (68), 18 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 06:58:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 425 transitions. [2024-11-07 06:58:28,796 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 425 transitions. Word has length 214 [2024-11-07 06:58:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:28,796 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 425 transitions. [2024-11-07 06:58:28,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-11-07 06:58:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 425 transitions. [2024-11-07 06:58:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:58:28,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:28,798 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:28,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:58:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 06:58:28,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:28,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash -922150607, now seen corresponding path program 1 times [2024-11-07 06:58:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:58:28,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384192387] [2024-11-07 06:58:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:58:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:58:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805941576] [2024-11-07 06:58:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:29,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:58:29,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:58:29,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:58:29,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:58:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:58:29,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:58:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:58:29,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:58:29,473 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:58:29,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:58:29,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 06:58:29,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:58:29,678 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:29,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:58:29,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:58:29 BoogieIcfgContainer [2024-11-07 06:58:29,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:58:29,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:58:29,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:58:29,828 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:58:29,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:48" (3/4) ... [2024-11-07 06:58:29,831 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:58:29,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:58:29,832 INFO L158 Benchmark]: Toolchain (without parser) took 42564.42ms. Allocated memory was 100.7MB in the beginning and 486.5MB in the end (delta: 385.9MB). Free memory was 76.2MB in the beginning and 256.2MB in the end (delta: -180.0MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. [2024-11-07 06:58:29,832 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:58:29,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.43ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 60.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:58:29,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.86ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 55.4MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:58:29,833 INFO L158 Benchmark]: Boogie Preprocessor took 76.64ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 48.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:58:29,833 INFO L158 Benchmark]: RCFGBuilder took 624.43ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 53.0MB in the end (delta: -4.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-07 06:58:29,833 INFO L158 Benchmark]: TraceAbstraction took 41434.14ms. Allocated memory was 100.7MB in the beginning and 486.5MB in the end (delta: 385.9MB). Free memory was 52.1MB in the beginning and 256.3MB in the end (delta: -204.2MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2024-11-07 06:58:29,833 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 486.5MB. Free memory was 256.3MB in the beginning and 256.2MB in the end (delta: 123.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:58:29,835 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 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.43ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 60.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.86ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 55.4MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.64ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 48.9MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 624.43ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 53.0MB in the end (delta: -4.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41434.14ms. Allocated memory was 100.7MB in the beginning and 486.5MB in the end (delta: 385.9MB). Free memory was 52.1MB in the beginning and 256.3MB in the end (delta: -204.2MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 486.5MB. Free memory was 256.3MB in the beginning and 256.2MB in the end (delta: 123.9kB). 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 someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someUnaryDOUBLEoperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L146] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L150] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L151] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L152] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L155] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L157] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L161] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L164] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L165] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L167] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] var_1_22 = var_1_10 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L60] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L65] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L76] COND TRUE var_1_10 != ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L77] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L79] COND FALSE !((~ var_1_4) > (var_1_4 / var_1_11)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L82] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_4)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L83] COND FALSE !(var_1_7 == var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L88] COND TRUE var_1_40 >= var_1_39 [L89] var_1_38 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L92] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L93] COND FALSE !(((var_1_11 + -128) % var_1_10) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L99] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=50] [L99] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L104] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L106] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L106] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L107] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L108] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L112] signed long int stepLocal_1 = -4; [L113] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L114] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L119] var_1_18 = var_1_17 [L120] var_1_19 = 0 [L121] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=-386, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L125] COND TRUE var_1_3 <= var_1_1 [L126] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L130] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32767, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L131] COND TRUE (~ var_1_3) < stepLocal_2 [L132] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L189] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L189-L190] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=-386, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=125, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 17, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2754 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2726 mSDsluCounter, 8781 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6483 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5343 IncrementalHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 2298 mSDtfsCounter, 5343 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2020 GetRequests, 1858 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=16, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 990 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 4243 NumberOfCodeBlocks, 4243 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4010 ConstructedInterpolants, 0 QuantifiedInterpolants, 18868 SizeOfPredicates, 8 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 37114/37696 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 [2024-11-07 06:58:29,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:58:32,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:58:32,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:58:32,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:58:32,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:58:32,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:58:32,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:58:32,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:58:32,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:58:32,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:58:32,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:58:32,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:58:32,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:58:32,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:58:32,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:58:32,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:58:32,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:58:32,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:58:32,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:58:32,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:58:32,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:58:32,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2024-11-07 06:58:32,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:58:32,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:58:32,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:58:32,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:58:32,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:58:32,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-11-07 06:58:33,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:58:34,059 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:58:34,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-11-07 06:58:34,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce0706b83/cc80a74acdf54b2c86d231a9c0db0302/FLAGf95b21d51 [2024-11-07 06:58:34,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce0706b83/cc80a74acdf54b2c86d231a9c0db0302 [2024-11-07 06:58:34,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:58:34,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:58:34,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:58:34,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:58:34,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:58:34,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5743d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34, skipping insertion in model container [2024-11-07 06:58:34,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:58:34,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2024-11-07 06:58:34,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:58:34,283 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:58:34,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i[919,932] [2024-11-07 06:58:34,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:58:34,348 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:58:34,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34 WrapperNode [2024-11-07 06:58:34,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:58:34,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:58:34,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:58:34,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:58:34,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,393 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-07 06:58:34,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:58:34,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:58:34,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:58:34,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:58:34,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,427 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:58:34,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:58:34,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:58:34,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:58:34,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:58:34,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (1/1) ... [2024-11-07 06:58:34,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:58:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:58:34,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:58:34,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:58:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:58:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:58:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:58:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:58:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:58:34,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:58:34,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:58:34,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:58:36,057 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:58:36,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:58:36,069 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:58:36,069 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:58:36,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:58:36 BoogieIcfgContainer [2024-11-07 06:58:36,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:58:36,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:58:36,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:58:36,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:58:36,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:58:34" (1/3) ... [2024-11-07 06:58:36,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdaeaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:58:36, skipping insertion in model container [2024-11-07 06:58:36,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:58:34" (2/3) ... [2024-11-07 06:58:36,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdaeaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:58:36, skipping insertion in model container [2024-11-07 06:58:36,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:58:36" (3/3) ... [2024-11-07 06:58:36,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-11-07 06:58:36,097 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:58:36,097 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:58:36,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:58:36,173 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49d5f551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:58:36,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:58:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:58:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:58:36,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:36,197 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:36,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:36,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1041527578, now seen corresponding path program 1 times [2024-11-07 06:58:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287174314] [2024-11-07 06:58:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:36,216 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 [2024-11-07 06:58:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:36,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2024-11-07 06:58:36,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:36,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:58:36,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-07 06:58:36,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:58:36,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:36,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287174314] [2024-11-07 06:58:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287174314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:36,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:58:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144968042] [2024-11-07 06:58:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:58:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:36,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:58:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:58:36,697 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:58:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:36,722 INFO L93 Difference]: Finished difference Result 177 states and 318 transitions. [2024-11-07 06:58:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:58:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 06:58:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:36,732 INFO L225 Difference]: With dead ends: 177 [2024-11-07 06:58:36,733 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 06:58:36,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:58:36,742 INFO L432 NwaCegarLoop]: 139 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, 139 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 [2024-11-07 06:58:36,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:58:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 06:58:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 06:58:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:58:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 139 transitions. [2024-11-07 06:58:36,789 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 139 transitions. Word has length 203 [2024-11-07 06:58:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:36,789 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 139 transitions. [2024-11-07 06:58:36,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:58:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2024-11-07 06:58:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:58:36,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:36,793 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:36,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:36,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:36,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:36,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1486207146, now seen corresponding path program 1 times [2024-11-07 06:58:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996894001] [2024-11-07 06:58:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:36,996 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 [2024-11-07 06:58:36,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:36,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2024-11-07 06:58:37,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:37,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:58:37,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-11-07 06:58:38,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:58:39,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:39,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996894001] [2024-11-07 06:58:39,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996894001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:58:39,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:58:39,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-11-07 06:58:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745917846] [2024-11-07 06:58:39,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:58:39,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:58:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:58:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:58:39,179 INFO L87 Difference]: Start difference. First operand 88 states and 139 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-11-07 06:58:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:39,838 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-07 06:58:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 06:58:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 203 [2024-11-07 06:58:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:39,848 INFO L225 Difference]: With dead ends: 185 [2024-11-07 06:58:39,848 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 06:58:39,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2024-11-07 06:58:39,850 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 106 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:39,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 188 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:58:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 06:58:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-07 06:58:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:58:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2024-11-07 06:58:39,867 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 203 [2024-11-07 06:58:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:39,868 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2024-11-07 06:58:39,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-11-07 06:58:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2024-11-07 06:58:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 06:58:39,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:39,871 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:39,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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)] Ended with exit code 0 [2024-11-07 06:58:40,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:40,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1119816408, now seen corresponding path program 1 times [2024-11-07 06:58:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343010498] [2024-11-07 06:58:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:40,073 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 [2024-11-07 06:58:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:40,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2024-11-07 06:58:40,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:40,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:58:40,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:58:40,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:58:40,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343010498] [2024-11-07 06:58:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343010498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:58:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291560759] [2024-11-07 06:58:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:40,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:58:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:40,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:58:40,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:40,698 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:40,766 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2024-11-07 06:58:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:58:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-07 06:58:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:40,779 INFO L225 Difference]: With dead ends: 186 [2024-11-07 06:58:40,779 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 06:58:40,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:40,780 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:40,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:58:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 06:58:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 06:58:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 57 states have internal predecessors, (70), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:58:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-11-07 06:58:40,801 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 203 [2024-11-07 06:58:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:40,802 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-11-07 06:58:40,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:58:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-11-07 06:58:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:58:40,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:40,807 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:40,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-11-07 06:58:41,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:41,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:41,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash -548618951, now seen corresponding path program 1 times [2024-11-07 06:58:41,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:41,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435271917] [2024-11-07 06:58:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:41,009 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 [2024-11-07 06:58:41,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:41,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2024-11-07 06:58:41,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:41,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 06:58:41,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-07 06:58:42,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:45,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435271917] [2024-11-07 06:58:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435271917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:58:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1668847712] [2024-11-07 06:58:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:45,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:58:45,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:58:45,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:58:45,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 06:58:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:46,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 06:58:46,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-07 06:58:47,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1668847712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:58:48,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:58:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2024-11-07 06:58:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254384863] [2024-11-07 06:58:48,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:58:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:58:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:58:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2024-11-07 06:58:48,113 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2024-11-07 06:58:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:48,997 INFO L93 Difference]: Finished difference Result 277 states and 393 transitions. [2024-11-07 06:58:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 06:58:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) Word has length 204 [2024-11-07 06:58:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:49,003 INFO L225 Difference]: With dead ends: 277 [2024-11-07 06:58:49,003 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 06:58:49,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=304, Unknown=0, NotChecked=0, Total=506 [2024-11-07 06:58:49,005 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 55 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:49,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 537 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:58:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 06:58:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2024-11-07 06:58:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 103 states have internal predecessors, (120), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:58:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2024-11-07 06:58:49,040 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 204 [2024-11-07 06:58:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:49,041 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2024-11-07 06:58:49,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2024-11-07 06:58:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2024-11-07 06:58:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 06:58:49,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:49,045 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:58:49,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-07 06:58:49,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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)] Ended with exit code 0 [2024-11-07 06:58:49,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 [2024-11-07 06:58:49,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:49,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:49,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1828482629, now seen corresponding path program 1 times [2024-11-07 06:58:49,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:49,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573093366] [2024-11-07 06:58:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:49,448 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 [2024-11-07 06:58:49,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:49,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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) [2024-11-07 06:58:49,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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)] Waiting until timeout for monitored process [2024-11-07 06:58:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:49,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 06:58:49,752 INFO L278 TraceCheckSpWp]: Computing forward predicates...